CV Lattes
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation for the last research proposal) Birthplace: Brazil
In currently is a PhD student at State University of Campinas (UNICAMP). Has experience in Computer Science, focusing on Approximation Algorithms and Theoretical Computing, working on the following subjects: Packing, Routing and Scheduling Problems. (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 this work we are interested in study packing problems, especially those considered NP-hard. If we consider that P != NP, we know that there are no efficient algorithms to solve such problems. Several techniques have been developed to deal with NP-Hard problems e.g., integer programming, constraint programming, approximation algorithms, probabilistic algorithms and heuristics. In this p…
| 1 / 1 | Completed scholarships in Brazil |
| Associated processes | |