graduation at Ciência da Computação from Universidade Estadual de Londrina (2012), master's at Computer Science from Universidade de São Paulo (2015) and doctorate at Computer Science from Universidade de São Paulo (2020). Has experience in Production Engineering, focusing on Linear, Nonlinear, Mixing and Dynamic Programming, acting on the following subjects: cutting and packing, irregular strip packing problem, clique covering, mixed integer programming and nesting. (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) |
A polyomino is a set of unit squares connected by joining one of their edges. A quasi-polyomino is a polyomino generalization, since it is a subset of not necessarily connected squares obtained from an equidistant raster grid. Quasi-polyominoes cutting and packing problems have many real applications, for instance, leather cutting, sheet metal stamping, printed circuit boards design and m…
The irregular strip packing problem consists of cutting a set of two-dimensional piecesfrom an object of fixed width using the smallest possible length. Despite its economicimportance for many industrial sectors, few exact studies have been made on this problemdue to its difficulty of resolution. Recently, Toledo et al. (2013) proposed a mixed-integermodel to this problem in which the pie…
| 3 / 3 | Completed scholarships in Brazil |
| Associated processes | |
CV Lattes