CV Lattes
Universidade Estadual de Campinas (UNICAMP). Faculdade de Engenharia Elétrica e de Computação (FEEC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Vinícius Amaral Armentano is full professor at the Faculty of Electrical Engineering and Computing (FEEC) at the State Universitiy of Campinas (UNICAMP). He is was awarded a BSc degree in Electrical Engineering from the Mackenzie University in 1974, in São Paulo, and obtained the degrees of MSc in Electrical Engineering from the FEEC-UNICAMP and PhD in Electrical Engineering from the Imperial College in London, in 1970 and 1983, respectively. He was a visiting professor of the Leeds School of Business at the University of Colorado in 2000. His main research interests lie in the area of combinatorial optimization, with modelling and resolution of problems in logistics and production planning and scheduling, and development of exact and heuristic methods in mixed integer programming. (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 problems focused in this thematic project were divided into: (A) cutting problems; (B) packing problems; (C) lot-sizing problems; (D) scheduling problems; (E) routing problems (F) location problems and (G) the integration of these problems. In addition to the study and development of mathematical models related to these problems, solution methods and algorithms to solve them will be d…
In this research project we intend to study: (i) cutting and packing problems, (ii) lot sizing and scheduling problems, (iii) the integration between cutting and/or packing problems in (i) with the lot sizing and/or scheduling problems in (ii). This continues the research developed in a previous thematic project whose financial support ended in March 2010, in which the main subject was th…
The main subject of this thematic project is the study of Cutting and Packing Problems (CPP), which covers a large number of combinatorial optimization problems. These problems share the common feature of fitting items inside an object. This fitting, in its actual sense, can define the cutting of pieces in stock to produce the demanded items, as well as, the packing of boxes in a containe…
(Only some records are available in English at this moment)
This project deals with the development of generic search heuristics that interact with optimization commercial optimization solvers to solve combinatorial optimization problems which are formulated as mixed integer programming programs. This is a recent theme that makes use of the expressive advance in research and development in the solvers and the flexibility of heuristics to obtain hi…
This project is associated with the doctoral thesis of Ramon Faganello Fachini initiated in 2015 under my supervision. It deals with a vehicle routing problem with flexible time windows, stochastic travel times, and a heterogeneous fleet with a limited or unlimited number of vehicles. We consider flexible time windows that allow limited early and late servicing at customers with respect t…
| 12 / 5 | Completed research grants |
| 10 / 1 | Completed scholarships in Brazil |
| 2 / 1 | Completed scholarships abroad |
| 24 / 7 | All research grants and scholarships |
| Associated processes | |