On two dimensional packing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 33204 (Why is no real title available?)
- scientific article; zbMATH DE number 1003243 (Why is no real title available?)
- A better lower bound for on-line scheduling
- A lower bound for on-line bin packing
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- New Algorithms for Bin Packing
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Two-dimensional rectangle packing: On-line methods and results
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- Two packing problems
- Performance Bound for Bottom-Left Guillotine Packing of Rectangles
- A new two-dimensional interleaving technique using successive packing
- Absolute approximation ratios for packing rectangles into bins
- Packing rectangles in a strip
- The packing of two species of polygons on the square lattice
This page was built for publication: On two dimensional packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054823)
