Abstract
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.
Cite
CITATION STYLE
Jansen, K. (2017). New algorithmic results for bin packing and scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10236 LNCS, pp. 10–15). Springer Verlag. https://doi.org/10.1007/978-3-319-57586-5_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
