Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

DOI10.1007/BF02309555zbMath0626.68037MaRDI QIDQ580978

J. B. G. Frenk, Gábor Galambos

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

probabilistic analysison-line algorithmheuristic algorithmworst-case analysisbin-packingtwo-dimensional packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

A note on the approximability of cutting stock problems, Two- and three-dimensional parametric packing, Packing, covering and tiling in two-dimensional spaces, Recent advances on two-dimensional bin packing problems, Approximation algorithm for the oriented two-dimensional bin packing problem, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Two-dimensional packing problems: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• A probabilistic analysis of the next fit decreasing bin packing heuristic
• A lower bound for on-line bin packing
• Fast algorithms for bin packing
• Probabilistic Analysis of Bin Packing Heuristics
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• On Packing Two-Dimensional Bins
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms