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
Associate Professor at the Department of Applied Mathematics and Statistics at the Institute of Mathematics and Computer Science at the University of São Paulo (ICMC-USP). Bachelor in Computer Science from the Institute of Mathematics and Statistics of the University of São Paulo (IME-USP - 2001), Master's in Computer Science from IME-USP (2004), Doctorate in Computer Science from IME-USP (2008) and "livre docência" at ICMC-USP. Has experience in the area of Optimization, particularly in Non-Linear and Integer Programming, and in solving Cutting and Packing problems, especially with irregular items. (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) |
Maximal Covering Location Problems (MCLP) appear when there are not enough resources to cover all demand points. They also appear when a company wants to maximize its profit for the selected covering. Any point within the covering distance is covered and the others are not. The problem involves implementing different types of coverings that have specific associated costs. The goal is to …
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…
This project aims at the application of mathematical tools to optimize the work of family farmers, in particular, those who cultivate organic products. More precisely, we intend to use optimization tools to decide what and when to plant in each region of the land, taking into account the products that are available for planting, the possible demands for each product, and cultivation condi…
(Only some records are available in English at this moment)
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…
| 1 / 1 | Completed research grants |
| 12 / 12 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 14 / 14 | All research grants and scholarships |
| Associated processes | |