Two- and three-dimensional parametric packing
From MaRDI portal
Publication:875405
DOI10.1016/j.cor.2005.10.001zbMath1141.90585OpenAlexW2112558270MaRDI QIDQ875405
Flávio K. Miyazawa, Yoshiko Wakabayashi
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.001
Related Items (6)
Fast machine reassignment ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ Integrated topology optimization with embedded movable holes based on combined description by material density and level sets ⋮ Optimal packing configuration design with finite-circle method ⋮ Three-dimensional packings with rotations ⋮ Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- Recent advances on two-dimensional bin packing problems
- Parametric on-line algorithms for packing rectangles and boxes.
- Fast algorithms for bin packing
- Two-dimensional packing problems: a survey
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
- On Three-Dimensional Packing
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- On Packing Two-Dimensional Bins
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- The Three-Dimensional Bin Packing Problem
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
This page was built for publication: Two- and three-dimensional parametric packing
