Algorithms for packing problems

• Grant number: 21/04409-7
• Support Opportunities: Scholarships in Brazil - Post-Doctoral
• Effective date (Start): May 01, 2021
• Effective date (End): December 31, 2021
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Computational Mathematics
• Principal Investigator: Flávio Keidi Miyazawa
• Grantee: Vinícius Antonio Battagello
• 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 certain dimension that must be packed inside containers, satisfying some restrictions. The packing must be done by optimizing a specific objective function. The packing problems we consider have applications in several areas such as logistics, resource allocation on computers, among others. The objective of this project is the theoretical and practical study of these problems, with the development of algorithms for them, as well as evidence regarding the determination of which classes of complexity the problems are in. (AU)