About me
Apresentação
Presentación
I am a Professor at the Department of Theoretical Computing (DTC) of the Institute of Computing (IC) of Universidade Estadual de Campinas (Unicamp). Usually, I lecture courses on design and analisis of algorithms, computational complexity, linear integer programming, and combinatorial optimization for graduate and undergraduate students in Computer Science and Computer Engineering.
Academic Degree
Titulação Acadêmica
Titulación Académica
- Ph.D. in Computer Science from the Institute of Mathematics and Statistics (IME) of the University of São Paulo (USP), Brazil (2016)
- Master's in Computer Science from the Institute of Informatics (INF) of the Federal University of Goiás (UFG), Brazil (2011)
- Bachelor in Computer Science from the Faculty of Mathematics and Computation (MATCOM) of the University of Habana (UH), Cuba (2007)
Research Interests
Interesses de Pesquisa
Intereses de Investigación
I'm interested in the study of optimization problems that emerge from practical applications and whose solutions belong to discrete domains. The theoretical approaches may include proofs on the difficulty of solving or approximating these problems and their variants. More applied approaches will attempt to solve them with standard optimization methods or by proposing new techniques and algorithms. Specifically, I work with the following research topics:
- Approximation Algorithms
- Combinatorial Optimization
- Computational Complexity
- Heuristics and Metaheuristics
- Mathematical Programming
- Operational Research
Students interested in pursuing graduate studies in Computer Science on the above topics, or undergraduate studies on those themes, feel free to contact me.
Teaching
Ensino
Enseñanza
Students
Alunos
Alumnos
Graduate
Pós-Graduação
Posgrado
Evelyn Roberta de Lima Silva
Master's thesis: Optimizing scheduling for caregivers and nursing teams in home healthcare
João Augusto Ferreira de Moura
Master's thesis: Algorithms for the covering salesman problem and variations
Sergio Gustavo Sanchez Rojas
Master's thesis: Exact solution for the optimal communication spanning tree problem
Undergraduate
Graduação
Pregrado
Daniela Souza Cardoso Naves
Scientific initiation: Algoritmos para problemas de cobertura exata por subgrafos
Guilherme Guidotti Brandt
Scientific initiation: Formulações e algoritmos para o problema da árvore geradora de comunicação ótima
Gustavo Henrique Sencio de Souza
Scientific initiation: O problema do Empacotamento de subgrafos em grafos
Victor Luigi Roquetto
Scientific initiation: Algoritmos para problemas de tráfego de informação em grafos
Ended Supervisions
Orientações Finalizadas
Tutorías Concluídas
Jordi Pujol Ricarte
Scientific initiation: Algoritmos para problemas de otimização combinatória em redes de comunicação modelados com grafos
Felipe Furtado Lorenci
Master's thesis: The joint order batching and picking routing problem: algorithms and new formulation
Tiago Furtado Drehmer Pinheiro
Co-supervisor: Luciana Salete Buriol
Master's thesis: The k-labeled spanning forest problem: complexity, approximability, formulations and algorithms
Giovane Alves Fonseca
Bachelor's thesis: Formulations and algorithms for the Optimum Communication Spanning Tree problem
Leonardo Abreu Nahra
Co-supervisor: Luciana Salete Buriol
Bachelor's thesis: Proof of NP-hardness, new mathematical formulation and constructive heuristic for In-band Network Monitoring Optimization
Publications
Publicações
Publicaciones
Packing sets of paths, stars and triangles: tractability and approximability
- Santiago V. Ravelo, Flávio K. Miyazawa
- International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), 2025
- DOI: 10.1007/978-3-031-83438-7_21
Complexity and approximability of minimum path-collection exact covers
- Santiago V. Ravelo, Cristina G. Fernandes
- Theoretical Computer Science, 2023
- DOI: 10.1016/j.tcs.2022.11.022
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 V. Ravelo
- IEEE Congress on Evolutionary Computation (CEC), 2022
- Download here DOI: 10.1109/CEC55065.2022.9870210
A fix-and-optimize matheuristic for the k-labelled spanning forest problem
- Tiago Furtado Drehmer Pinheiro, Santiago V. Ravelo, Luciana Salete Buriol
- IEEE Congress on Evolutionary Computation (CEC), 2022
- Download here DOI: 10.1109/CEC55065.2022.9870342
Approximation algorithms for simple assembly line balancing problems
- Santiago V. Ravelo
- Journal of Combinatorial Optimization, 2022
- Download here DOI: 10.1007/s10878-021-00778-2
Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
- Santiago V. Ravelo, Cláudio N. Meneses
- Computers & Operations Research, 2021
- Download here DOI: 10.1016/j.cor.2021.105441
Minimum constellation covers: hardness, approximability and polynomial cases
- Santiago V. Ravelo
- Journal of Combinatorial Optimization, 2021
- Download here DOI: 10.1007/s10878-021-00698-1
NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem
- Santiago V. Ravelo, Cláudio N. Meneses, Eduardo A.J. Anacleto
- IEEE Congress on Evolutionary Computation (CEC), 2020
- Download here DOI: 10.1109/cec48606.2020.9185558
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover
- Santiago V. Ravelo, Cláudio N. Meneses, Maristela O. Santos
- Journal of Heuristics, 2020
- Download here DOI: 10.1007/s10732-020-09443-z
Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem
- Eduardo A.J. Anacleto, Cláudio N. Meneses, Santiago V. Ravelo
- Computers & Operations Research, 2020
- Download here DOI: 10.1016/j.cor.2019.104774
A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- Santiago V. Ravelo, Carlos E. Ferreira
- Theoretical Computer Science, 2019
- Download here DOI: 10.1016/j.tcs.2018.11.008
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
- Santiago V. Ravelo, Carlos E. Ferreira
- Discrete Applied Mathematics, 2017
- Download here DOI: 10.1016/j.dam.2016.09.031
PTAS's for Some Metric p-Source Communication Spanning Tree Problems
- Santiago V. Ravelo, Carlos E. Ferreira
- International Workshop on Algorithms and Computation (WALCOM), 2015
- Download here DOI: 10.1007/978-3-319-15612-5_13
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
- Santiago V. Ravelo, Carlos E. Ferreira
- International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), 2015
- Download here DOI: 10.1007/978-3-319-14974-5_2
Projects
Projetos
Proyectos
Algoritmos para problemas de otimização combinatória em redes de comunicação modelados com grafos
Coordinator: Santiago Valdés Ravelo
Financial support: Faepex
Problemas de particionamento e conectividade na era dos dados: algoritmos e desafios computacionais
Coordinator: Flávio K. Miyazawa
Financial support: CNPq
Contact
Contato
Contacto
Students interested in pursuing graduate studies in Computer Science on Combinatorial Optimization, Algorithms or Operational Research, or undergraduate studies on those themes, feel free to contact me.
Address:
Endereço:
Dirección:
Av. Albert Einstein, 1251, Sala 06, Cidade Universitária, Campinas, SP, Brasil. CEP: 13083-852
Email:
ravelo@unicamp.br
Phone:
Telefone:
Teléfono:
+55 (19) 3521 0334