An algorithm for the three-dimensional packing problem with asymptotic performance analysis
From MaRDI portal
(Redirected from Publication:679456)
Recommendations
Cites work
Cited in
(22)- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- scientific article; zbMATH DE number 3990764 (Why is no real title available?)
- scientific article; zbMATH DE number 773158 (Why is no real title available?)
- 3-D container packing heuristics
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- Resource augmentation in two-dimensional packing with orthogonal rotations
- scientific article; zbMATH DE number 2230208 (Why is no real title available?)
- 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
- Two- and three-dimensional parametric packing
- An improved typology of cutting and packing problems
- Cube packing.
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- 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
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)
