PTAS's for Some Metric p-source Communication Spanning Tree Problems. - Santiago Valdés Ravelo; Carlos E. Ferreira (WALCOM, 2015)

Optimum communication spanning tree problem: variants, complexity and approximation. - Santiago Valdés Ravelo (2016)

A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. - Santiago Valdés Ravelo; Carlos Eduardo Ferreira (Discret. Appl. Math., 2017)

A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem. - Santiago Valdés Ravelo; Carlos Eduardo Ferreira (Theor. Comput. Sci., 2019)

NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem. - Santiago Valdés Ravelo; Cláudio N. Meneses; Eduardo A. J. Anacleto (CEC, 2020)

Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. - Eduardo A. J. Anacleto; Cláudio N. Meneses; Santiago Valdés Ravelo (Comput. Oper. Res., 2020)

Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. - Santiago Valdés Ravelo; Cláudio N. Meneses; Maristela Oliveira Santos (J. Heuristics, 2020)

Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems. - Santiago Valdés Ravelo; Cláudio N. Meneses (Comput. Oper. Res., 2021)

Minimum constellation covers: hardness, approximability and polynomial cases. - Santiago Valdés Ravelo (J. Comb. Optim., 2021)

A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem. - Felipe Furtado Lorenci; Santiago Valdés Ravelo (CEC, 2022)

A fix-and-optimize matheuristic for the k-labelled spanning forest problem. - Tiago F. D. Pinheiro; Santiago Valdés Ravelo; Luciana S. Buriol (CEC, 2022)

Approximation algorithms for simple assembly line balancing problems. - Santiago Valdés Ravelo (J. Comb. Optim., 2022)

Complexity and approximability of Minimum Path-Collection Exact Covers. - Santiago Valdés Ravelo; Cristina G. Fernandes (Theor. Comput. Sci., 2023)

Packing Sets of Paths, Stars and Triangles: Tractability and Approximability. - Santiago Valdés Ravelo; Flávio Keidi Miyazawa (CALDAM, 2025)