CV Lattes
Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica (IMECC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
bachelor's at Ciencias da Computação from Universidade Estadual de Campinas (1980), master's at Engenharia Industrial e Sistemas from Georgia Institute of technology (1989), master's at Mathematics from Universidade Estadual de Campinas (1983) and doctorate at Engenharia Industrial e Sistemas from Georgia Institute of technology (1992). Has experience in Production Engineering, focusing on Linear, Nonlinear, Mixing and Dynamic Programming, acting on the following subjects: programacao linear, programação linear inteira, heurísticas, meta-heurísticas and programacao nao-linear. (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) |
The object of study this project is the investigation of the Multiobjective Integer Cutting Problems (MICP). As we know, even in simplest version, this problem is of the combinatorial nature, characterized in the literature as NP-Hard, which motivates the academic community in the search for solution methods more efficient. In addition, few studies have been performed with the multi-objec…
Many practical problems in Engineering, Applied Mathematics, Physics, Science, Economics, Finance, Financial Optimization, Microeconomics, Marketing, Transportation, Strategic Planning, among others, are modeled in a very convenient way by Global Optimization problems of the NP-hard type, where the objective functions to be optimized are described by (sum of) products of two (or more) fun…
A cutting problem is "to determine" how best to cut a set of objects, i.e. of parts available in stock to produce a series of smaller units, usually called items, quantities from previously demanded. In one-dimensional cutting stock problems, just the width of demanded items is relevant, where such items must be well-matched so that the loss caused by the cutting pattern generated is the …
The object of this internship is the investigation of methods to solve Multiobjective Integer Cutting Stock Problems. As we know, this problem is of combinatorial nature, characterized in the literature as NP-hard, that motivates the academic community in the research for methods more and more efficient. In literature, there are very few studies that address this problem by opting for cla…
| 5 / 3 | Completed research grants |
| 7 / 3 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 13 / 7 | All research grants and scholarships |
| Associated processes | |