Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

DOI10.1137/S009753979631391XzbMath0941.68053OpenAlexW2003912596MaRDI QIDQ4943855

Flávio K. Miyazawa, Yoshiko Wakabayashi

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979631391x

zbMATH Keywords

approximation algorithmsthree-dimensional packingasymptotic performance bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (14)

Two- and three-dimensional parametric packing ⋮ Cube packing. ⋮ Parametric on-line algorithms for packing rectangles and boxes. ⋮ An algorithm for the three-dimensional packing problem with asymptotic performance analysis ⋮ MIP-based approaches for the container loading problem with multi-drop constraints ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ Multidimensional cube packing ⋮ A comparative review of 3D container loading algorithms ⋮ Upper Bounds for Heuristic Approaches to the Strip Packing Problem ⋮ Three-dimensional packings with rotations ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ Unnamed Item ⋮ Resource augmentation in two-dimensional packing with orthogonal rotations ⋮ Constraints in container loading -- a state-of-the-art review

This page was built for publication: Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem