CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
graduation at Ciência da Computação from Universidade Federal de Mato Grosso do Sul (1990), master's at Mathematics from Universidade de São Paulo (1993) and doctorate at Mathematics from Universidade de São Paulo (1997). He is currently full professor at Universidade Estadual de Campinas. Has experience in Computer Science, focusing on Analysis of Algorithms and Computational Complexity, acting on the following subjects: problemas de corte e empacotamento, algoritmos de aproximação, otimização combinatória, problemas de escalonamento de tarefas and teoria dos jogos. (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) |
In this research project, we aim to investigate combinatorial optimisation problems, both theoretical as well as practical problems, coming from real applications. The main research line is to investigate packing problems. In the bin packing problem, we have to pack a set of one-dimensional items, each one with a given weight, into bins of a given capacity. The items packed in a same bin…
In the future circular economy, the movement of raw materials, products, residues for recycling and production resources across all regions of the global is a key requirement. Logistics operations can already represent up to 35% of the logistics costs and this relative importance may grow even higher. Therefore, the optimal plan and management of the logistics operations can determine the…
(Only some records are available in English at this moment)
Combinatorial optimization problems are the subject of extensive study due to their numerous practical applications. Among the methods used to address such problems, approximation algorithms are one of the primary tools, owing to their speed compared to other approaches. This project explores the key techniques of this paradigm, focusing on two classic problems that have a substantial bod…
In this project we are interested in investigating combinatorial optimization problems, especially packing problems. In packing problems, we have a number of items in a given dimension that must be packed into containers satisfying some constraints. The packing must be done by optimizing a given objective function. The packing problems that we consider have applications in several areas s…
In this project we are interested in investigating combinatorial optimization problems, especially packing problems. In packing problems, we have a number of items in a given dimension that must be packed into containers satisfying some constraints. The packing must be done by optimizing a given objective function. The packing problems that we consider have applications in several areas s…
(Only some records are available in English at this moment)
Cutting and Packing Problems are often considered as applications in the real world. Both classes of problems can be considered theoretically equivalent, as cutting an item from a recipient may be equivalent to placing an item into a bin. In this project, we consider orthogonal packing problems, mainly on their versions with two- and three-dimensions. These problems consider the placement…
This is a proposal for a research internship of Phablo Fernando Soares Moura (FAPESP Proc. 2016/21250-3), postdoctoral researcher under supervision of Professor Flávio Keidi Miyazawa at the Instituto de Computação at Universidade Estadual de Campinas. This internship, to be held at Charles University in Prague, the Czech Republic, is planned from August 1, 2018 to July 31, 2019 (12 months…
Approximation algorithms have received great attention from the research community working on optimization and computer theory. Such algorithms are mainly used to solve NP-hard problems, for which no exact algorithm would be viable. There are several techniques used to obtain approximations for the facility location problem and others. Usually, these techniques can be used when dealing wi…
(Only some records are available in English at this moment)
| 6 / 6 | Completed research grants |
| 27 / 19 | Completed scholarships in Brazil |
| 4 / 4 | Completed scholarships abroad |
| 37 / 29 | All research grants and scholarships |
| Associated processes | |