Probabilistic analysis of shelf algorithms for strip packing
From MaRDI portal
Recommendations
- Probabilistic analysis of a new class of strip packing algorithms
- Shelf algorithms for on-line strip packing
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- New upper bounds for online strip packing
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
Cites work
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- A 2.5 times optimal algorithm for packing in two dimensions
- A algorithm for two-dimensional packing
- A near-optimal solution to a two-dimensional cutting stock problem
- On the sum-of-squares algorithm for bin packing
- Optimal rectangle packing
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Shelf Algorithms for Two-Dimensional Packing Problems
Cited in
(8)- Algorithms for Packing Squares: A Probabilistic Analysis
- Probabilistic analysis of a new class of strip packing algorithms
- Shelf algorithms for on-line strip packing
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- Expected performance of the shelf heuristic for 2-dimensional packing
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Numerical optimization method for packing regular convex polygons
This page was built for publication: Probabilistic analysis of shelf algorithms for strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491239)
