Algorithms for Packing Problems with Unloading Constraints

• Grant number: 11/08563-9
• Support Opportunities: Scholarships in Brazil - Doctorate
• Effective date (Start): August 01, 2011
• Effective date (End): October 31, 2013
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Eduardo Candido Xavier
• Grantee: Jefferson Luiz Moisés da Silveira
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

Abstract

In this work we are interested in study packing problems, especially those considered NP-hard. If we consider that P != NP, we know that there are no efficient algorithms to solve such problems. Several techniques have been developed to deal with NP-Hard problems e.g., integer programming, constraint programming, approximation algorithms, probabilistic algorithms and heuristics. In this project we are interested in studying and developing algorithms for packing problems with unloading constraints. We are particularly interested in formal techniques and approximation algorithms. Our goal is to study the main techniques used in the literature and assess the practical feasibility of the studied algorithms. It is also our goal to develop new approximation algorithms lower bounds for the studied problem using conventional techniques or new techniques such as Algorithmic Game Theory.

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

SILVEIRA, Jefferson Luiz Moisés da. Algorithms for packing and routing problems. 2013. Doctoral Thesis - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação Campinas, SP.