Data structures for higher-dimensional rectilinear packing
From MaRDI portal
Recommendations
Cites work
- A heuristic for the three-dimensional strip packing problem
- A hybrid placement strategy for the three-dimensional strip packing problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An improved typology of cutting and packing problems
- Computational geometry. Algorithms and applications.
- Extreme point-based heuristics for three-dimensional bin packing
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- scientific article; zbMATH DE number 1303061 (Why is no real title available?)
- Packing small boxes into a big box.
- The Three-Dimensional Bin Packing Problem
- Three-dimensional packing of items with limited load bearing strength
Cited in
(1)
This page was built for publication: Data structures for higher-dimensional rectilinear packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815459)