The study of theoretical and practical combinatorial optimization problems applied...
A Combinatorial Branch-and-Bound Algorithm for the Bin Packing Problem
Cutting, packing, lot-sizing and scheduling problems and their integration in indu...
Grant number: | 22/06707-8 |
Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
Effective date (Start): | August 01, 2022 |
Effective date (End): | February 28, 2023 |
Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Theory of Computation |
Principal Investigator: | Flávio Keidi Miyazawa |
Grantee: | Santosh Kumar Mandal |
Host Institution: | Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |
Associated research grant: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points, AP.TEM |
Abstract 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 such as logistics, allocation of computer resources, among others. The objective of this project is to investigate these problems in theoretical and practical ways, with the development of algorithms for them, as well as, investigate their complexity classes. (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) | |