An asymptotic approximation algorithm for 3D-strip packing

DOI10.1145/1109557.1109575MaRDI QIDQ3581487zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

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

Cited in

(11)

• Algorithmic analysis of priority-based bin packing
• Approximation algorithms for orthogonal packing problems for hypercubes
• Rectangle packing with one-dimensional resource augmentation
• Hardness of approximation for orthogonal rectangle packing and covering problems
• Three-dimensional packings with rotations
• A hybrid placement strategy for the three-dimensional strip packing problem
• Priority-based bin packing with subset constraints
• Polynomial-time approximation schemes for circle and other packing problems
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• A reference length approach for the 3D strip packing problem
• Constraints in container loading -- a state-of-the-art review

This page was built for publication: An asymptotic approximation algorithm for 3D-strip packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581487)