Pages that link to "Item:Q5704216"
From MaRDI portal
The following pages link to Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing (Q5704216):
Displaying 16 items.
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Online square-into-square packing (Q521815) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← links)
- Packing cubes into a cube is NP-complete in the strong sense (Q2354306) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- Packing Cubes into a Cube in (D>3)-Dimensions (Q3196389) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)