CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Estadual Paulista (UNESP). Campus de Bauru. Faculdade de Ciências (FC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
graduation at Licenciatura em Matemática from Universidade Estadual Paulista Júlio de Mesquita Filho (2011), master's at Computer Science from Universidade de São Paulo (2014) and doctorate at Computer Science from Universidade de São Paulo (2019). Has experience in optimization (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) |
Determining an efficient layout is a combinatorial optimization problem known as the cutting and packing problem. Once a layout is defined, in some industries, the issue of which is the best way to cut it arises. This second problem is known as the cutting path determination problem and consists of finding the path that one or more cutting tools must follow in order to execute a given lay…
The packing and cutting problem has been faced by industries of clothing, metalworking, furniture, footwear and other sectors. It consists in cutting larger objects into smaller ones to minimize, for example, material loss. In this research we deal with a two-dimensional irregular packing and cutting problem, known as nesting problem, whose main characteristic (and obstacle) is its irregu…
This work aims to study and adapt numerical methods for Markov jump linear systems. This is an important class of systems that provide useful models for applications featuring abrupt changes of behavior. Moreover, there are several strong results available in literature, that resemble the ones of standard deterministic linear systems. In this work we focus on an adaptation of the classica…
Having great applicability in industries, the packing problem aims to define a cutting plane of large objects to obtain small pieces minimizing, for instance, raw material waste. The main characteristic and obstacle of the irregular strip packing problem, studied in this research, is the irregular shape of its pieces. In some industries, after a cutting plane has been defined, a second pr…
| 1 / 1 | Ongoing grants |
| 2 / 2 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 4 / 4 | All research grants and scholarships |
| Associated processes | |