A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
From MaRDI portal
Publication:3960135
DOI10.1137/0602019zbMath0496.68049OpenAlexW2009202733WikidataQ89224516 ScholiaQ89224516MaRDI QIDQ3960135
Brenda S. Baker, Edward G. jun. Coffman
Publication date: 1981
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0602019
Related Items (23)
A probabilistic analysis of the next fit decreasing bin packing heuristic ⋮ Probabilistic analysis of the next fit decreasing algorithm for bin- packing ⋮ Parametric Lower Bound for On-Line Bin-Packing ⋮ BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem ⋮ Next-fit packs a list and its reverse into the same number of bins ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A note on a selfish bin packing problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Open-end bin packing: new and old analysis approaches ⋮ Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle ⋮ Bin packing with general cost structures ⋮ Unnamed Item ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ On bin packing with clustering and bin packing with delays ⋮ A new version of on-line variable-sized bin packing ⋮ Packing problems ⋮ More on online bin packing with two item sizes ⋮ A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case ⋮ Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem ⋮ More on batched bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Several methods of analysis for cardinality constrained bin packing
Cites Work
This page was built for publication: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
