Expected performance of the shelf heuristic for 2-dimensional packing
From MaRDI portal
Publication:1121176
DOI10.1016/0167-6377(89)90026-6zbMath0673.90072OpenAlexW1964712701MaRDI QIDQ1121176
Jixian Zhang, John H. Vande Vate, John J. III Bartholdi
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90026-6
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Stochastic programming (90C15) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Multiple-type, two-dimensional bin packing problems: Applications and algorithms, The nesting problem in the leather manufacturing industry, Efficient heuristics for robot acquisition planning for a CIM system, Expected performance of the shelf heuristic for 2-dimensional packing, Exact algorithms for the guillotine strip cutting/packing problem., Packing problems, Packings in two dimensions: Asymptotic average-case analysis of algorithms, Average-case analysis of cutting and packing in two dimensions
Cites Work
- A probabilistic analysis of the next fit decreasing bin packing heuristic
- The average-case analysis of some on-line algorithms for bin packing
- Expected performance of the shelf heuristic for 2-dimensional packing
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- A class of simple stochastic online bin packing algorithms
- Probabilistic Analysis of Bin Packing Heuristics
- Shelf Algorithms for Two-Dimensional Packing Problems
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
- Two-dimensional packing: expected performance of simple level algorithms
- Orthogonal Packings in Two Dimensions
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
