An asymptotic approximation algorithm for 3D-strip packing
From MaRDI portal
Publication:3581487
DOI10.1145/1109557.1109575zbMath1192.90176OpenAlexW4233184946MaRDI QIDQ3581487
Roberto Solis-Oba, Klaus Jansen
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109575
Related Items (11)
Algorithmic analysis of priority-based bin packing ⋮ Rectangle packing with one-dimensional resource augmentation ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ A reference length approach for the 3D strip packing problem ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ Priority-based bin packing with subset constraints ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ Three-dimensional packings with rotations ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ Approximation algorithms for orthogonal packing problems for hypercubes ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for publication: An asymptotic approximation algorithm for 3D-strip packing
