An algorithm for the three-dimensional packing problem with asymptotic performance analysis
From MaRDI portal
Publication:679456
DOI10.1007/BF02523692zbMath0876.68051OpenAlexW1972902146MaRDI QIDQ679456
Yoshiko Wakabayashi, Flávio K. Miyazawa
Publication date: 22 April 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02523692
Related Items
Global optimization for the three-dimensional open-dimension rectangular packing problem, Polynomial-time approximation schemes for circle and other packing problems, An improved typology of cutting and packing problems, Two- and three-dimensional parametric packing, Cube packing., Parametric on-line algorithms for packing rectangles and boxes., A comparative review of 3D container loading algorithms, Three-dimensional packings with rotations, Unnamed Item, A global optimization algorithm for the three-dimensional packing problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, 3-D container packing heuristics, Resource augmentation in two-dimensional packing with orthogonal rotations, Constraints in container loading -- a state-of-the-art review
Cites Work
