Three-dimensional packings with rotations

DOI10.1016/j.cor.2008.12.015zbMath1160.90641OpenAlexW1972804506MaRDI QIDQ1017455

Yoshiko Wakabayashi, Flávio K. Miyazawa

Publication date: 19 May 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.015

zbMATH Keywords

approximation algorithmspacking problemsorthogonal rotations

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ Solving packing problems by a distributed global optimization algorithm ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ A comparative review of 3D container loading algorithms ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• An on-line algorithm for multidimensional bin packing
• Two- and three-dimensional parametric packing
• Bin packing can be solved within 1+epsilon in linear time
• Cube packing.
• Parametric on-line algorithms for packing rectangles and boxes.
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• This side up!
• On Three-Dimensional Packing
• On strip packing With rotations
• An asymptotic approximation algorithm for 3D-strip packing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• On Packing Two-Dimensional Bins
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Mathematical Foundations of Computer Science 2003
• LATIN 2004: Theoretical Informatics