scientific article; zbMATH DE number 1183280
From MaRDI portal
Publication:3838010
Recommendations
- A new exact method for the two-dimensional orthogonal packing problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- scientific article; zbMATH DE number 1264415
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Exact solution techniques for two-dimensional cutting and packing
Cited in
(15)- Ein neuer Ansatz zur Bestimmung theoretischer Obergrenzen für das zweidimensionale orthogonale homogene Packproblem. (A new approach to the determination of theoretical upper bounds for the two-dimensional orthogonal homogeneous packing problem)
- Conservative scales in packing problems
- MPQ-trees for orthogonal packing problem
- scientific article; zbMATH DE number 994195 (Why is no real title available?)
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- scientific article; zbMATH DE number 1225305 (Why is no real title available?)
- scientific article; zbMATH DE number 1264415 (Why is no real title available?)
- scientific article; zbMATH DE number 6850331 (Why is no real title available?)
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
- Efficient algorithms for orthogonal packing problems
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Complexity results for the horizontal bar packing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838010)
