Average-case performance analysis of a 2D strip packing algorithm -- NFDH
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A stochastic model of bin-packing
- Average-case analysis of cutting and packing in two dimensions
- Average-case analysis of the smart next fit algorithm
- Orthogonal Packings in Two Dimensions
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Some distributions that allow perfect packing
- The average-case analysis of some on-line algorithms for bin packing
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Cited in
(3)
This page was built for publication: Average-case performance analysis of a 2D strip packing algorithm -- NFDH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774522)