On Packing Two-Dimensional Bins
From MaRDI portal
Publication:3958477
DOI10.1137/0603007zbMath0495.05016OpenAlexW1989028842MaRDI QIDQ3958477
Michael R. Garey, David S. Johnson, Fan R. K. Chung
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
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40)
Related Items
Multiple-type, two-dimensional bin packing problems: Applications and algorithms, There is no asymptotic PTAS for two-dimensional vector packing, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, Adaptive simulated annealing with greedy search for the circle bin packing problem, The nesting problem in the leather manufacturing industry, Bin packing with divisible item sizes, Polynomial-time approximation schemes for circle and other packing problems, A note on the approximability of cutting stock problems, Fast machine reassignment, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Next-fit packs a list and its reverse into the same number of bins, Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing, Efficient heuristics for robot acquisition planning for a CIM system, Packing Cubes into a Cube in (D>3)-Dimensions, Approximation and online algorithms for multidimensional bin packing: a survey, Two- and three-dimensional parametric packing, Multidimensional on-line bin packing: Algorithms and worst-case analysis, An exact method for the 2D guillotine strip packing problem, On-line bin packing ? A restricted survey, Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle, Tight approximation algorithms for geometric bin packing with skewed items, An introduction to the two‐dimensional rectangular cutting and packing problem, Delineation of site‐specific management zones using estimation of distribution algorithms, Cube packing., Parametric on-line algorithms for packing rectangles and boxes., The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Absolute approximation ratios for packing rectangles into bins, The three-dimensional knapsack problem with balancing constraints, On-line algorithms for 2-space bounded 2-dimensional bin packing, Two-dimensional packing with conflicts, Packing, covering and tiling in two-dimensional spaces, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS, Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing, Oriented aligned rectangle packing problem, Packing problems, Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing, Recent advances on two-dimensional bin packing problems, Multidimensional cube packing, A 3-approximation algorithm for two-dimensional bin packing, An approximation algorithm for square packing., Two-dimensional online bin packing with rotation, Online strip packing with modifiable boxes, Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem, ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING, Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions, An agent-based approach to the two-dimensional guillotine bin packing problem, Approximation algorithm for the oriented two-dimensional bin packing problem, Three-dimensional packings with rotations, Analysis of a first-fit algorithm for the capacitated unit covering problem, Techniques and results on approximation algorithms for packing circles, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS, Two-dimensional packing problems: a survey, Two-dimensional rectangle packing: On-line methods and results, A note on one-space bounded square packing, Packing cubes into a cube is NP-complete in the strong sense, New approximability results for two-dimensional bin packing
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
