A new asymptotic approximation algorithm for 3-dimensional strip packing
From MaRDI portal
Recommendations
- Harmonic algorithm for 3-dimensional strip packing problem
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- A (5/3 + )-approximation for strip packing
- A (5/3+)-approximation for strip packing
Cited in
(16)- A reference length approach for the 3D strip packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- New approximability results for two-dimensional bin packing
- Approximate strip packing: revisited
- A heuristic for the three-dimensional strip packing problem
- A harmonic algorithm for the 3D strip packing problem
- Harmonic algorithm for 3-dimensional strip packing problem
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
- On approximating strip packing with a better ratio than 3/2
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Peak demand minimization via sliced strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- Packing d-dimensional balls into a d + 1-dimensional container
- Improved approximation algorithms for three-dimensional knapsack
- Improved approximation algorithms for three-dimensional bin packing
This page was built for publication: A new asymptotic approximation algorithm for 3-dimensional strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938110)