CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Federal de São Carlos (UFSCAR). Centro de Ciências Exatas e de Tecnologia (CCET) (Institutional affiliation from the last research proposal) Birthplace: Brazil
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) |
The Balanced Multiway Cut Problem (BMCP) is a combination of the Multiway Cut Problem and the Balanced Cut Problem, both NP-Hard variations of the classic Minimum Cut problem. In BMCP, we want to find a set of edges, with minimum cost, whose removal partitions the graph into several components, so that each component has exactly one terminal and has at most a fraction of the graph's verti…
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…
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 …
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…
(Only some records are available in English at this moment)
Vehicle Routing Problems (VRPs) play a critical role in optimizing logistics by minimizingfuel consumption and time, with applications ranging from deliveries to medical assistance.Recent advances in drone technology have introduced drones into VRPs, enabling faster andmore cost-effective solutions. This project focuses on the Clustered Flying Sidekick Travel-ling Salesman Problem (CFSTSP…
Natural disasters often disrupt ground networks, posing significant challenges for humanitarian logistics when assessing communities in affected areas. To address this, the Combined Drone Orienteering Problem (CDOP) integrates the use of drones and trucks for post-disaster assessments, maximizing informational gains within a limited time frame. Drones, capable of traversing inaccessible a…
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 |
| 14 / 12 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 3 / 3 | Completed scholarships abroad |
| 19 / 17 | All Scholarships |
| Associated processes | |