CV Lattes
ResearcherID
ORCID
Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Has experience in Mathematics, focusing on Applied Mathematics (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) |
Irregular cutting problems (or nesting problems) are problems that aim to determine an optimal arrangement of smaller irregular objects (items) inside larger objects (containers) in order to meet a demand. We are particularly interested in the problem of cutting irregular items on reused sheets, in which we have various rectangular and irregular sheets (derived from previous cuts), each w…
Irregular cutting problems (or nesting problems) are problems that aim to determine an optimal arrangement of smaller irregular objects (items) inside larger objects (containers) in order to meet a demand. We are particularly interested in the bin packing problem, where we have several rectangular and irregular containers, each with fixed sizes, and we want to allocate all the items in th…
Rectangular cutting problems focus on determining an optimal arrangement of smaller rectangular objects (items) within larger objects (slabs) to meet specific demands. This research particularly addresses the cutting problem with slab reuse, involving several rectangular slabs of fixed sizes, some new and others from previous cuts. The goal is to allocate all items onto these slabs withou…
| 2 / 2 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 3 / 3 | All Scholarships |
| Associated processes | |