Santiago Valdés Ravelo

15 papers B 4Journal 8Unranked 2
YearRankTypeTitle / Venue / Authors
2025 — conf
Packing Sets of Paths, Stars and Triangles: Tractability and Approximability.
CALDAM
Santiago Valdés Ravelo, Flávio Keidi Miyazawa
2023 J jnl
Complexity and approximability of Minimum Path-Collection Exact Covers.
Theor. Comput. Sci.
Santiago Valdés Ravelo, Cristina G. Fernandes
2022 B conf
A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem.
CEC
Felipe Furtado Lorenci, Santiago Valdés Ravelo
2022 B conf
A fix-and-optimize matheuristic for the k-labelled spanning forest problem.
CEC
Tiago F. D. Pinheiro, Santiago Valdés Ravelo, Luciana S. Buriol
2022 J jnl
Approximation algorithms for simple assembly line balancing problems.
J. Comb. Optim.
Santiago Valdés Ravelo
2021 J jnl
Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems.
Comput. Oper. Res.
Santiago Valdés Ravelo, Cláudio N. Meneses
2021 J jnl
Minimum constellation covers: hardness, approximability and polynomial cases.
J. Comb. Optim.
Santiago Valdés Ravelo
2020 J jnl
Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem.
Comput. Oper. Res.
Eduardo A. J. Anacleto, Cláudio N. Meneses, Santiago Valdés Ravelo
2020 J jnl
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover.
J. Heuristics
Santiago Valdés Ravelo, Cláudio N. Meneses, Maristela Oliveira Santos
2020 B conf
NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem.
CEC
Santiago Valdés Ravelo, Cláudio N. Meneses, Eduardo A. J. Anacleto
2019 J jnl
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem.
Theor. Comput. Sci.
Santiago Valdés Ravelo, Carlos Eduardo Ferreira
2017 J jnl
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem.
Discret. Appl. Math.
Santiago Valdés Ravelo, Carlos Eduardo Ferreira
2016 — —
Optimum communication spanning tree problem: variants, complexity and approximation.
Santiago Valdés Ravelo
2015 — conf
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem.
CALDAM
Santiago Valdés Ravelo, Carlos E. Ferreira
2015 B conf
PTAS's for Some Metric p-source Communication Spanning Tree Problems.
WALCOM
Santiago Valdés Ravelo, Carlos E. Ferreira