An algorithm for the three-dimensional packing problem with asymptotic performance analysis

DOI10.1007/BF02523692zbMATH Open0876.68051OpenAlexW1972902146MaRDI QIDQ679456FDOQ679456

Authors: Flávio K. Miyazawa, Yoshiko Wakabayashi 

Publication date: 22 April 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02523692

Recommendations

• On Three-Dimensional Packing
• scientific article; zbMATH DE number 21364
• A new asymptotic approximation algorithm for 3-dimensional strip packing
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

zbMATH Keywords

packing problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• A algorithm for two-dimensional packing
• On Three-Dimensional Packing
• Heuristic algorithms for on-line packing in three dimensions
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

Cited In (22)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
• 3-D container packing heuristics
• Resource augmentation in two-dimensional packing with orthogonal rotations
• Title not available (Why is that?)
• Three-dimensional packings with rotations
• A new asymptotic approximation algorithm for 3-dimensional strip packing
• A quasi-human algorithm for solving the three-dimensional rectangular packing problem
• Harmonic algorithm for \(3\)-dimensional strip packing problem
• Parametric on-line algorithms for packing rectangles and boxes.
• Polynomial-time approximation schemes for circle and other packing problems
• An improved typology of cutting and packing problems
• Two- and three-dimensional parametric packing
• Global optimization for the three-dimensional open-dimension rectangular packing problem
• Cube packing.
• A global optimization algorithm for the three-dimensional packing problem
• A comparative review of 3D container loading algorithms
• Constraints in container loading -- a state-of-the-art review
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems

This page was built for publication: An algorithm for the three-dimensional packing problem with asymptotic performance analysis

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