CV Lattes
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Ph.D. candidate at the IC-Unicamp under supervision of professors Rafael Schouery and Flávio Miyazawa. His research is concerned with exact approaches to cutting and packing problems, including Branch-and-Price and Branch-and-Cut techniques as well as pseudo-polynomial formulations. He completed his Masters in 2016 with a dissertation on Branch-and-Price algorithms for the Class-Constrained Bin Packing Problem under supervision of professor Flávio Miyazawa at IC-Unicamp. Before that he got his Bachelor in Computer Science from the Federal University of Goiás with a period abroad at The State University of New York and Stanford University. (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) |
In this project, we interested in studying the cutting stock problem under class constraints. In this problem, we look for the minimal amount of rolls from which we can cut smaller items of different classes (or colors), sizes and demands, knowing that each roll has a limit on the amount of items with different colors that can be cut from it. This kind of problem has received little atten…
| 1 / 1 | Completed scholarships in Brazil |
| Associated processes | |