| Grant number: | 14/25892-4 |
| Support Opportunities: | Scholarships in Brazil - Master |
| Start date: | April 01, 2015 |
| End date: | February 29, 2016 |
| Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Theory of Computation |
| Agreement: | Coordination of Improvement of Higher Education Personnel (CAPES) |
| Principal Investigator: | Flávio Keidi Miyazawa |
| Grantee: | Yulle Glebbyo Felipe Borges |
| Host Institution: | Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |
Abstract In this project, we interested in studying the cutting stock problem under class constraints. In this problem, we look for the minimal amount of rolls from which we can cut smaller items of different classes (or colors), sizes and demands, knowing that each roll has a limit on the amount of items with different colors that can be cut from it. This kind of problem has received little attention from the literature. We intendo to use Branch-and-Price techniques to look for optimal integer solutions for this problem. Branch-and-Price has shown success in solving some cutting and packing problems such as the simple cutting stock problem, however there are few works on using this technique to solve problems with class constraints. This technique uses the problem's structure to find integer solutions, so it is necessary to be cautious to implement it so that the problem' structure is not modified in a way that makes it even harder to be solved. One of the main objectives of this project is to present an effective Branch-and-Price technique to solve the class-constrained cutting stock problem in its unidimensional and bidimensional variants. (AU) | |
| News published in Agência FAPESP Newsletter about the scholarship: | |
| More itemsLess items | |
| TITULO | |
| Articles published in other media outlets ( ): | |
| More itemsLess items | |
| VEICULO: TITULO (DATA) | |
| VEICULO: TITULO (DATA) | |