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