A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing

DOI10.1007/978-3-319-04298-5_29zbMath1432.68576OpenAlexW54707646MaRDI QIDQ2938110

Lars Prädel, Klaus Jansen

Publication date: 13 January 2015

Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_29

zbMATH Keywords

approximation algorithmsstrip packingpacking boxes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (max. 100)

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Peak demand minimization via sliced strip packing ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ New approximability results for two-dimensional bin packing

This page was built for publication: A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing