The following pages link to On strip packing With rotations (Q3581413):
Displayed 12 items.
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- A note on online strip packing (Q1029271) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)