Cube packing.

DOI10.1016/S0304-3975(02)00647-3zbMath1044.68161OpenAlexW2912952744MaRDI QIDQ1401310

Flávio K. Miyazawa, Yoshiko Wakabayashi

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00647-3

zbMATH Keywords

Approximation algorithmsAsymptotic performanceCube packingon-line algorithm for packing problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

An improved typology of cutting and packing problems ⋮ Packing Cubes into a Cube in (D>3)-Dimensions ⋮ Dynamic multi-dimensional bin packing ⋮ A note on online hypercube packing ⋮ Online bin packing of squares and cubes ⋮ Bounds for online bounded space hypercube packing ⋮ Online bin packing of squares and cubes ⋮ Three-dimensional packings with rotations ⋮ Online square and cube packing ⋮ Packing cubes into a cube is NP-complete in the strong sense ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• An on-line algorithm for multidimensional bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• GENERALIZED FIRST-FIT ALGORITHMS IN TWO AND THREE DIMENSIONS
• Algorithms for Packing Squares: A Probabilistic Analysis
• On Packing Two-Dimensional Bins
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• On packing of squares and cubes