Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3619919 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A algorithm for two-dimensional packing
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Resource constrained scheduling as generalized bin packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(61)- A note on one-space bounded square packing
- Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
- New approximability results for two-dimensional bin packing
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Bin packing with divisible item sizes
- An efficient job scheduling algorithm in partitionable mesh connected systems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Online strip packing with modifiable boxes
- Next-fit packs a list and its reverse into the same number of bins
- Packing cubes into a cube is NP-complete in the strong sense
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- Two-dimensional rectangle packing: On-line methods and results
- Analysis of a first-fit algorithm for the capacitated unit covering problem
- 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
- Tight approximation algorithms for geometric bin packing with skewed items
- Recent advances on two-dimensional bin packing problems
- The nesting problem in the leather manufacturing industry
- An exact method for the 2D guillotine strip packing problem
- Delineation of site‐specific management zones using estimation of distribution algorithms
- 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
- 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 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.
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- On-line bin packing ? A restricted survey
- 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
- Two- and three-dimensional parametric packing
- Fast machine reassignment
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Packing problems
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- A 3-approximation algorithm for two-dimensional bin packing
- Packing cubes into a cube in \((D>3)\)-dimensions
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Two-dimensional packing problems: a survey
- The three-dimensional knapsack problem with balancing constraints
- Cube packing.
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Online algorithm for 1-space bounded multi-dimensional bin packing
- One-space bounded algorithms for two-dimensional bin packing
- 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
- A new branch-and-cut approach for integrated planning in additive manufacturing
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)
