Harmonic algorithm for 3-dimensional strip packing problem
From MaRDI portal
Harmonic algorithm for \(3\)-dimensional strip packing problem
Recommendations
- A harmonic algorithm for the 3D strip packing problem
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- Two- and three-dimensional parametric packing
- Three-dimensional packings with rotations
Cited in
(12)- Three-dimensional packings with rotations
- Approximation algorithms for orthogonal packing problems for hypercubes
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- A reference length approach for the 3D strip packing problem
- Constraints in container loading -- a state-of-the-art review
- Approximation and online algorithms for multidimensional bin packing: a survey
- A harmonic algorithm for the 3D strip packing problem
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- A hybrid placement strategy for the three-dimensional strip packing problem
- Rectangle packing with one-dimensional resource augmentation
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing
- An asymptotic worst case analysis of the effectiveness of the harmonic 3D-shelf algorithm for online 3D-strip packing
This page was built for publication: Harmonic algorithm for \(3\)-dimensional strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934715)
