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 |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
Vehicle routing problems aim to minimize the costs of routes taken by delivery vehicles, they are also highly interesting and heavily studied. With the emergence and advancement of drone technology, these classic problems have been gaining new variations that involve the collaboration of traditional vehicles with drones. This project aims to study these problems and formulate new solution…
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 Flying Sidekick Traveling Salesman Problem (FSTSP) is a generalization of the Traveling Salesman Problem (TSP) that has gained relevance due to the advancement of technologies involving unmanned aerial vehicles, popularly called drones. In this problem we have a drone embarked to assist a truck in delivering packages to customers. In this project we intend to study the application of …
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…
Vehicle Routing Problems, in general, involve decisions that minimize the costs of transporting products through different routes using several vehicles to serve a non-homogeneous and geographically dispersed demand. These problems have great impact for the three sectors of economy, since they aim to minimize costs and to model logistical systems that are present from the manufacturing of…
(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)
| 2 / 2 | Ongoing scholarships in Brazil |
| 12 / 10 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 16 / 14 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID