| Meta-heuristics for the one-dimensional cutting stock problem with usable leftover SV Ravelo, CN Meneses, MO Santos Journal of Heuristics 26, 585-618, 2020 | 16 | 2020 |
| Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem EAJ Anacleto, CN Meneses, SV Ravelo Computers & Operations Research 113, 104774, 2020 | 9 | 2020 |
| NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem SV Ravelo, CN Meneses, EAJ Anacleto 2020 IEEE Congress on Evolutionary Computation (CEC), 1-8, 2020 | 4 | 2020 |
| PTAS’s for Some Metric p-source Communication Spanning Tree Problems SV Ravelo, CE Ferreira International Workshop on Algorithms and Computation, 137-148, 2015 | 4 | 2015 |
| Approximation algorithms for simple assembly line balancing problems SV Ravelo Journal of Combinatorial Optimization 43 (2), 432-443, 2022 | 3 | 2022 |
| Minimum constellation covers: hardness, approximability and polynomial cases SV Ravelo Journal of Combinatorial Optimization 41, 603-624, 2021 | 2 | 2021 |
| A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem SV Ravelo, CE Ferreira Theoretical Computer Science 771, 9-22, 2019 | 2 | 2019 |
| A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem SV Ravelo, CE Ferreira Conference on Algorithms and Discrete Applied Mathematics, 9-20, 2015 | 2 | 2015 |
| Mathematical programming models for the one-dimensional cutting stock problem with usable leftover SV Ravelo, CN Meneses, MO Santos XLII SBPO, 2010 | 2 | 2010 |
| Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems SV Ravelo, CN Meneses Computers & Operations Research 135, 105441, 2021 | 1 | 2021 |
| A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem SV Ravelo, CE Ferreira Discrete Applied Mathematics 228, 158-175, 2017 | 1 | 2017 |
| Complexity and approximability of Minimum Path-Collection Exact Covers SV Ravelo, CG Fernandes Theoretical Computer Science 942, 21-32, 2023 | | 2023 |
| A fix-and-optimize matheuristic for the k-labelled spanning forest problem TFD Pinheiro, SV Ravelo, LS Buriol 2022 IEEE Congress on Evolutionary Computation (CEC), 1-8, 2022 | | 2022 |
| A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem FF Lorenci, SV Ravelo 2022 IEEE Congress on Evolutionary Computation (CEC), 1-8, 2022 | | 2022 |
| Problema da árvore geradora de comunicação ótima: variantes, complexidade e aproximação SV Ravelo Universidade de São Paulo, 2016 | | 2016 |
| Optimum communication spanning tree problem: variants, complexity and approximation. SV Ravelo University of São Paulo, Brazil, 2016 | | 2016 |
| Modelo SV RAVELO | | |
