New Algorithmic Results for Bin Packing and Scheduling

Jansen, Klaus (2017) New Algorithmic Results for Bin Packing and Scheduling Algorithms and Complexity. Springer, Cham, pp. 10-15. DOI 10.1007/978-3-319-57586-5_2.

Full text not available from this repository.

Supplementary data:


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.

Research supported by the Deutsche Forschungsgemeinschaft (DFG), Project Ja 612/14-2, Entwicklung und Analyse von effizienten polynomiellen Approximationsschemata für Scheduling- und verwandte Optimierungsprobleme.

Document Type: Book chapter
Research affiliation: Kiel University
Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Refereed: Yes
DOI etc.: 10.1007/978-3-319-57586-5_2
ISSN: 0302-9743
Date Deposited: 19 Dec 2017 10:47
Last Modified: 19 Dec 2017 10:47

Actions (login required)

View Item View Item