On Packing Two-Dimensional Bins
From MaRDI portal
Publication:3958477
DOI10.1137/0603007zbMath0495.05016MaRDI QIDQ3958477
David S. Johnson, Fan R. K. Chung, Michael R. Garey
Publication date: 1982
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/58236
68Q25: Analysis of algorithms and problem complexity
05B40: Combinatorial aspects of packing and covering
Related Items
On-line bin packing ? A restricted survey, Online strip packing with modifiable boxes, Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem, Recent advances on two-dimensional bin packing problems, An approximation algorithm for square packing., Two- and three-dimensional parametric packing, Two-dimensional packing with conflicts, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, An agent-based approach to the two-dimensional guillotine bin packing problem, Three-dimensional packings with rotations, Bin packing with divisible item sizes, Next-fit packs a list and its reverse into the same number of bins, Multidimensional on-line bin packing: Algorithms and worst-case analysis, Oriented aligned rectangle packing problem, Packing problems, Two-dimensional rectangle packing: On-line methods and results, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Cube packing., Parametric on-line algorithms for packing rectangles and boxes., Multidimensional cube packing, Approximation algorithm for the oriented two-dimensional bin packing problem, Two-dimensional packing problems: a survey, The nesting problem in the leather manufacturing industry, Efficient heuristics for robot acquisition planning for a CIM system, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, A 3-approximation algorithm for two-dimensional bin packing, A note on the approximability of cutting stock problems, Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle, Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resource constrained scheduling as generalized bin packing
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
