The following pages link to On Packing Two-Dimensional Bins (Q3958477):
Displaying 50 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Fast machine reassignment (Q338866) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- On-line algorithms for 2-space bounded 2-dimensional bin packing (Q456101) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- An approximation algorithm for square packing. (Q703277) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- Next-fit packs a list and its reverse into the same number of bins (Q1109684) (← links)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (Q1123131) (← links)
- Oriented aligned rectangle packing problem (Q1196022) (← links)
- Packing problems (Q1197916) (← links)
- Two-dimensional rectangle packing: On-line methods and results (Q1309806) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- Cube packing. (Q1401310) (← links)
- Parametric on-line algorithms for packing rectangles and boxes. (Q1405228) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- Multidimensional cube packing (Q1762987) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Efficient heuristics for robot acquisition planning for a CIM system (Q1908995) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
- A note on one-space bounded square packing (Q2353640) (← links)
- Packing cubes into a cube is NP-complete in the strong sense (Q2354306) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- A 3-approximation algorithm for two-dimensional bin packing (Q2488211) (← links)
- A note on the approximability of cutting stock problems (Q2643962) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS (Q2998846) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Packing Cubes into a Cube in (D>3)-Dimensions (Q3196389) (← links)
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847) (← links)
