---

Information extracted from Lattes platform

Last update: 2023/07/20

ORCID: https://orcid.org/0000-0002-6831-2006

---

Current projects

2022 a Atual	Coordenador do projeto - PQ/CNPq - Algoritmos para problemas de otimização aplicados à computação Integrantes: Thiago Ferreira de Noronha (coordenador).
2019 a Atual	Coordenador do projeto - PPM/FAPEMIG - Algoritmos para Problemas de Otimização em Redes sem Fio Integrantes: Thiago Ferreira de Noronha (coordenador).

Current applied research projects

See all projects in Lattes

---

Recent publications

Articles in journals

A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
2023. International Transactions in Operational Research.
Exact algorithms for the product configuration problem
2023. International Transactions in Operational Research.
A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows
2022. Optimization Letters.
Robust min-max regret covering problems
2022. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (DORDRECHT. ONLINE).
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
2022. RAIRO-OPERATIONS RESEARCH.
The integrated uncapacitated lot sizing and bin packing problem
2021. RAIRO-OPERATIONS RESEARCH.
Improving logic-based Benders' algorithms for solving min-max regret problems
2021. Operations Research and Decisions.
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
2020. JOURNAL OF GLOBAL OPTIMIZATION.
On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
2019. RAIRO-OPERATIONS RESEARCH.
Integer Linear Programming Formulations for the Variable Data Rate and Variable Channel Bandwidth Scheduling Problem in Wireless Networks
2019. Computer Networks.
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
2017. Computers & Operations Research.
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
2014. Discrete Applied Mathematics.

Papers in conferences

A Biased Random-key Genetic Algorithm for the 2-Dimensional Guillotine Cutting Stock Problem with Stack Constraints
2022. 8th International Conference on Metaheuristics and Nature Inspired Computing.
Formulação de programação linear inteira para um problema de k-cobertura e m-conectividade em redes de sensores
2022. Simpósio Brasileiro de Pesquisa Operacional.
A Model for Scheduling a Fleet of Autonomous Electric Agricultural Robots
2022. Simpósio Brasileiro de Pesquisa Operacional.
Uma heurística ILS para o problema da mochila com penalidades
2021. Simpósio Brasileiro de Pesquisa Operacional.
The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints
2021. 2021 XLVII Latin American Computing Conference (CLEI).
A min-max regret approach for the Steiner Tree Problem with Interval Costs
2020. Simpósio Brasileiro de Pesquisa Operacional.
Heurísticas Construtivas para o Problema de Corte Guilhotinado Bidimensional em 3 Estágios com Restrições de Precedência
2019. Simpósio Brasileiro de Pesquisa Operacional.

Extended abstracts in conferences

Online Scheduling with Time Windows of Agricultural Robots
2021. 22ème congrès de la société française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF),.
Algorithms for the min-max regret 0-1 Integer Linear Programming Problem with Interval Data
2019. Metaheuristics International Conference.
A genetic algorithm for maximizing the accepted demands in routing and wavelength assignment in optical networks
2015. Metaheuristic International Conference.
A linear programming based heuristic for robust optimization problems: a case study on solving the restricted robust shortest path problem
2014. 5th International Workshop on Model-Based Metaheuristics.
A biased random-key genetic algorithm for the robust shortest path problem
2012. Global Optimization Workshop 2012.

Abstracts in conferences

Modelos e Heurísticas para o Problema Integrado de Dimensionamento de Lotes e de Empacotamento
2018. XIX Latin-Iberoamerican Conference on Operations Research.
Heuristic and exact algorithms for product configuration in software product lines
2018. Proceeedings of the 22nd International Conference.
Biased random-key genetic algorithms for divisible load scheduling
2015. 27th European Conference on Operational Research.
A Biased Random-key Genetic Algorithm to Maximize the Accepted Lightpaths in WDM Optical Networks
2014. INFORMS Anual Meeting.
Une étude de modèles mathématiques pour le problème du plus court chemin robuste
2013. 14ème congrès de la Sociètè Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF).

See all publications in Lattes

---

Current students

MS

Isabella de Melo Freitas. Abordagem heurística para um problema de programação de voos offshore. Início: 2021. Universidade Federal de Minas Gerais (Orientador principal)
José Ferreira Reis Fonseca. Algoritmos para problemas de k-cobertura em redes de sensores com tolerância a falhas. Início: 2020. Universidade Federal de Minas Gerais (Orientador principal)

PhD

Glauber Soares dos Santos. Heurísticas para o Problemas de Roteamento e Escalonamento Estocásticos. Início: 2023. Universidade Federal de Minas Gerais (Orientador principal)
Mateus Vilela Souza. Coupling Optimization and Simulation
 to Supervise a Fleet of Autonomous Agricultural Robots. Início: 2019. Université d'Auvergne (Co orientador)

See all students in Lattes

---