New Algorithmic Results for Bin Packing and Scheduling

摘要

In this paper we present an overview about new results for bin packing and related scheduling problems. During the last years we have worked on the design of efficient exact and approximation algorithms for packing and scheduling problems. In order to obtain faster algorithms we studied integer linear programming (ILP) formulations for these problems and proved structural results for optimum solutions of the corresponding ILPs.