B.Sc. in Computer Engineering at State University of Campinas (2007), M.Sc. in Computer Science at State University of Campinas (2010), and Ph.D. in Computer Science at State University of Campinas (2015), with one year of research internship abroad at Cornell University. Postdoctoral researcher in Computer Science at University of São Paulo (2018) and, currently, is an adjunct professor at the Department of Computing of Federal University of São Carlos. Has experience with Algorithms and Combinatorial Optimization, working mainly on the following subjects: online algorithms, competitive analysis, approximation algorithms, facility location problems, network design problems, and randomized algorithms. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| TITULO |
| Articles published in other media outlets (0 total): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
In the maximum flow problem, the goal is to determine how to send the largest possible amount of flow between two vertices of a network that have capacities in the arcs, so that no capacity is exceeded and no flow is lost. This problem is very relevant because it is useful in modeling a wide variety of other problems.This project has as objectives the study of algorithms for the maximum f…
The Physician Rostering Problem (PRP) seeks to assign shifts to physicians so that all the demands of the hospital are met, no physician is overloaded, and the scheduling is as pleasant as possible for them. Constraint Programming (CP) is a paradigm for solving combinatorial problems, which combines techniques of Artificial Intelligence, Theory of Computation, and Operations Research. Thi…
In Scheduling Problems, the goal is to find the best distribution of jobs to be performed by machines, aiming to minimize some aspect of the production process. Many of these problems have great theoretical difficulty, as they are NP-Hard, which means that there is no algorithm able to find the optimal solution in polynomial time, unless P=NP. They also have great practical relevance, mai…
The Vehicle Routing Problem involves finding a set of routes, which minimizes the overall costs, for a fleet of vehicles to traverse in order to serve a given set of customers. The problem is very important to industry, since it is useful for modeling logistical problems such as product distribution and people transportation. This project aims to study and develop exact algorithms for thi…
(Only some records are available in English at this moment)
In the Facility Location Problem, it is sought to decide how many and which facilities to open in order to serve the connection demands of the clients. It is a very relevant problem both due to its theoretical interest, being an NP-hard problem widely studied and for which numerous approximation algorithms and metaheuristics are known, as well as for being motivated by practical applicati…
In this project we work with the online and incremental versions of Facility Location Problems. (AU)
| 1 / 1 | Ongoing scholarships in Brazil |
| 11 / 9 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 14 / 12 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID