Pages that link to "Item:Q3581487"
From MaRDI portal
The following pages link to An asymptotic approximation algorithm for 3D-strip packing (Q3581487):
Displaying 11 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← 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)
- A reference length approach for the 3D strip packing problem (Q1926699) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)
