About me
About
Presentation
I am a Professor at the Department of Theoretical Computing (DTC) of the Institute of Computing (IC) of State University of Campinas (Unicamp). Usually, I lecture courses on design and analysis of algorithms, computational complexity, linear integer programming, and combinatorial optimization for graduate and undergraduate students in Computer Science and Computer Engineering.
I am a Professor in the Department of Theory of Computing (DTC) at Institute of Computing (IC) da State University of Campinas (Unicamp) I usually teach courses on algorithm design and analysis, computational complexity, integer linear programming, and combinatorial optimization to undergraduate and graduate students in Computer Science and Computer Engineering.
I am Adjunct Professor at the Department of Computer Theory (DTC) of Institute of Computing (IC) of the State University of Campinas (Unicamp). Usually, I provide materials on algorithm analysis and design, computational complexity, linear programming and discrete optimization for postgraduate and pregraduate students in Computer Science, and Computer Engineering.
Academic Degree
Academic Qualifications
Academic Qualification
- Ph.D. in Computer Science from the Institute of Mathematics and Statistics (IME) of the University of Sao Paulo (USP), Brazil (2016)
- PhD in Computer Science by the Institute of Mathematics and Statistics (IME) da University of São Paulo (USP), Brazil (2016)
- Doctorate in Computer Science by 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)
- Master in Computer Science by the Institute of Informatics (INF) da Federal University of Goiás (UFG), Brazil (2011)
- Masters in Computer Science by Institute of Informatics (INF) of the Federal University of Goiás (UFG), Brazil (2011)
- Bachelor of Computer Science from the Faculty of Mathematics and Computation (MATCOM) of the University of Havana (UH), Cuba (2007)
- Bachelor of Computer Science from Faculty of Mathematics and Computing (MATCOM) da University of Havana (UH), Cuba (2007)
- Degree in Computer Science awarded by the Faculty of Mathematics and Computing (MATCOM) of the University of Havana (UH), Cuba (2007)
Research Interests
Research Interests
Research Interests
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:
I'm interested in studying optimization problems arising from practical applications, whose solutions belong to discrete domains. Theoretical approaches may include proofs of the difficulty of solving or approximating these problems and their specific cases, while more applied approaches attempt to solve them using standard (optimization) methods or by proposing new techniques and algorithms. Specifically, I work on the following research topics:
I am interested in studying optimization problems arising from practical applications, whose solutions belong to discrete domains. Theoretical proposals can include tests on the difficulty of solving or approaching these problems and their particular cases, while more applied proposals will attempt to solve them with standard (optimization) methods or through new techniques and algorithms. Specifically, I work on the following research topics:
- Approximation Algorithms
- Combinatorial Optimization
- Computational Complexity
- Heuristics and Metaheuristics
- Mathematical Programming
- operational research
- Approximation Algorithms
- Combinatorial Optimization
- Computational Complexity
- Heuristics and Metaheuristics
- Mathematical Programming
- Operational Research
- Approximation Algorithms
- Discrete Optimization
- Computational Complexity
- Heuristics and Metaheuristics
- Mathematical Programming
- Operations 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.
Students interested in postgraduate studies in Computer Science covering any of the above topics, or who are interested in beginning undergraduate research on these topics, feel free to contact me.
Students interested in pursuing a postgraduate degree in Computer Science on any of the previous topics, who are interested in starting pre-graduate research on these topics, are free to contact me.
Teaching
Education
Teaching
Students
Students
Students
Graduate
Graduate Studies
Postgraduate
Carlos Eduardo Cavalieri Furtado
Master's thesisMasters dissertationMaster's Thesis: Prediction and Optimization of Interventions to Reduce School Dropout in Brazil
Eliel Lucas de Oliveira Carvalho
Master's thesisMasters dissertationMaster's Thesis: Precise Optimization of Charging Station Positioning for Vehicles with Limited Range
Evelyn Roberta de Lima Silva
Master's thesisMasters dissertationMaster's Thesis: Optimizing scheduling for caregivers and nursing teams in home healthcare
Hitalo Cesar Alves
Master's thesisMasters dissertationMaster's Thesis: Approximation and tractability of one-dimensional cutting problems
John Augusto Ferreira de Moura
Master's thesisMasters dissertationMaster's Thesis: Algorithms for the covering salesman problem and variations
Lademir Silva Rodrigues Junior
Master's thesisMasters dissertationMaster's Thesis: Algorithms for graph coloring problems
Pedro Henrique Rodrigues Pereira
Master's thesisMasters dissertationMaster's Thesis: Planning Charging Stations and Drone Fleet to Cover Areas of Interest
Pedro Paulo Gomes do Carmo
Master's thesisMasters dissertationMaster's Thesis: Integer Linear Programming Techniques for the Covered Traveling Salesman Problem and its variants
Sergio Gustavo Sanchez Rojas
Master's thesisMasters dissertationMaster's Thesis: Exact solution for the optimal communication spanning tree problem
Graduate
Undergraduate Studies
Undergraduate programs
Gustavo Henrique Sencio de Souza
Scientific initiationScientific researchScientific initiation: Colorful path coverings and packaging
Lucas Cardoso Pereira
Scientific initiationScientific researchScientific initiation: Graph algorithms for the problem of placing charging stations for robots with limited energy
Ended Supervisions
Finalized Guidelines
Completed Tutorials
Daniela Souza Cardoso Naves
Scientific initiationScientific researchScientific initiation: Algorithms for exact subgraph cover problems
Guilherme Guidotti Brandt
Scientific initiationScientific researchScientific initiation: Formulations and algorithms for the optimal communication spanning tree problem
Gustavo Henrique Sencio de Souza
Scientific initiationScientific researchScientific initiation: Colorful path coverings and packaging
Victor Luigi Roquetto
Scientific initiationScientific researchScientific initiation: Algorithms for information traffic problems in graphs
Jordi Pujol Ricarte
Scientific initiationScientific researchScientific initiation: Algorithms for combinatorial optimization problems in communication networks modeled with graphs
Felipe Furtado Lorenci
Master's thesisMasters dissertationMaster's Thesis: The joint order batching and picking routing problem: algorithms and new formulation
Tiago Furtado Drehmer Pinheiro
Co-supervisorCo-supervisorCo-tutor: Luciana Salete Buriol
Master's thesisMasters dissertationMaster's Thesis: The k-labeled spanning forest problem: complexity, approximability, formulations and algorithms
Giovane Alves Fonseca
Bachelor's thesisCompletion of course workTesis de graduación: Formulations and algorithms for the Optimum Communication Spanning Tree problem
Leonardo Abreu Nahra
Co-supervisorCo-supervisorCo-tutor: Luciana Salete Buriol
Bachelor's thesisCompletion of course workTesis de graduación: Proof of NP-hardness, new mathematical formulation and constructive heuristic for In-band Network Monitoring Optimization
Publications
Publications
Publications
Packing sets of paths, stars and triangles: tractability and approximability
- Santiago V. Ravelo, Flavio 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 Download here Come 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 Download here Come 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 Download here Come 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, Claudio N. Meneses
- Computers & Operations Research, 2021
- Download here Download here Come 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 Download here Come 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, Claudio N. Meneses, Eduardo AJ Anacleto
- IEEE Congress on Evolutionary Computation (CEC), 2020
- Download here Download here Come here DOI: 10.1109/cec48606.2020.9185558
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover
- Santiago V. Ravelo, Claudio N. Meneses, Maristela O. Santos
- Journal of Heuristics, 2020
- Download here Download here Come here DOI: 10.1007 / s10732-020-09443-z
Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem
- Eduardo AJ Anacleto, Claudio N. Meneses, Santiago V. Ravelo
- Computers & Operations Research, 2020
- Download here Download here Come 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 Download here Come 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 Download here Come 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 Download here Come 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 Download here Come here DOI: 10.1007/978-3-319-14974-5_2
Projects
Projects
Projects
New Strategies for Solving Combinatorial Optimization Problems
Coordinator: Coordinator: Coordinator: Rafael Crivellari Saliba Schouery
Financial support: CNPq Financier: CNPq Financier: CNPq
Algorithms for combinatorial optimization problems in communication networks modeled with graphs
Coordinator: Coordinator: Coordinator: Santiago Valdes Ravelo
Financial support: Unicamp Financier: Unicamp Financier: Unicamp
Partitioning and Connectivity Problems in the Data Age: Algorithms and Computational Challenges
Coordinator: Coordinator: Coordinator: Flavio K. Miyazawa
Financial support: CNPq Financier: CNPq Financier: CNPq
Contact
Contact
Contact
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.
Students interested in postgraduate studies in Computer Science covering Combinatorial Optimization, Algorithms, or Operations Research, or who are interested in beginning undergraduate research on these topics, feel free to contact me.
Students interested in pursuing a postgraduate degree in Computer Science on Discrete Optimization, Algorithms or Operations Research, or those interested in starting pre-graduate research on these topics, are welcome to contact me.
Address:
Address:
Address:
Albert Einstein Ave., 1251, Room 06, University City, Campinas, SP, Brazil. Postal Code: 13083-852
Email:
ravelo@unicamp.br
phone:
Phone:
Phone:
+55 (19) 3521 0334