- Research Grants
Bachelor- Computer Science - University of Brasília (2007), MSc - Computer Science - University of Campinas (2010), PhD - Computer Science - University of Campinas (2014). Currently Assistent professor at Institute of Computing - University of Campinas. (Source: Lattes Curriculum)
In several applications (e.g., transport, logistics, telecommunications, postal services and distribution networks), we need to install hubs, such as terminal airports or network switches. A hub is a consolidation and exchange center which allows direct connection, using a smaller number of indirect connections. In this project, we will study the hub allocation problems and variants. An...
Approximation algorithms are applied to combinatorial optimization problems, with the goal of efficiently obtaining solutions with guaranteed quality. The study of such algorithms leads to theoretical results that reveals a problem's structure and computational difficulty. In this project, we will investigate hub location problems (HLP) under the view of approximation algorithms. Given ...
The aim of this post-doctorate project is to study and to obtain approximation algorithms or inapproximability results for combinatorial optimization problems, specially those related to network design under more realistic constraints.The classical network design problems, such as k-center, k-median and facility location have a wide list of applications, such as router allocation, netwo...
(Only some records are available in English at this moment)
Approximation algorithms have received great attention from the research community working on optimization and computer theory. Such algorithms are mainly used to solve NP-hard problems, for which no exact algorithm would be viable. There are several techniques used to obtain approximations for the facility location problem and others. Usually, these techniques can be used when dealing ...
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
|Data from Web of Science|
(References retrieved automatically from State of São Paulo Research Institutions)
PEDROSA, Lehilton Lelis Chaves. Geração automática de casos de testes para máquinas de estados finitos. 2010. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (08/07969-9)
PEDROSA, Lehilton Lelis Chaves. Approximation algorithms for facility location problems and other supply chain problems. 2014. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas. (10/20710-4)
BENEDITO, Marcelo Pinheiro Leite. Approximation algorithms for hub location problems : Algoritmos de aproximação para problemas de localização e alocação de terminais. 2018. Dissertação (Mestrado) - (16/12006-1)