Graduated in Computer Science from the State University of Campinas (2023). Currently studying for a Master's degree in Computer Science at the State University of Campinas. Interested in optimization problems, in particular, cutting and packing problems, both from the point of view of heuristic and exact 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) |
Cutting and Packing Problems are essential in manufacturing and logistics. They aim to minimize waste, directly influencing operational efficiency. The Cutting Stock Problem (CSP) optimizes material cutting, while the Bin Packing Problem (BPP) focuses on efficient item packing. Given their high practical applications in industry and intrinsic computational complexities, they are problems …
The Bin Packing Problem consists of: given a set of items of different sizes, we have as objective distribute them in bins with limited capacity, minimizing the number of bins used. A generalization for the Bin Packing Problem is the Colored Bin Packing Problem, in which each item has a size and a color, with an extra restriction in which say that two items of the same color cannot be pac…
Cutting and Packing Problems are essential in manufacturing and logistics. They aim to minimize waste, directly influencing operational efficiency. The Cutting Stock Problem (CSP) optimizes material cutting, while the Bin Packing Problem (BPP) focuses on efficient item packing. Given their high practical applications in industry and intrinsic computational complexities, they have been wid…
| 2 / 2 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 3 / 3 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID