Bin packing with discrete item sizes, part II: Tight bounds on First Fit

DOI<69::AID-RSA4>3.0.CO;2-V 10.1002/(SICI)1098-2418(199701/03)10:1/2<69::AID-RSA4>3.0.CO;2-VzbMath0899.90137OpenAlexW2018816426WikidataQ101124974 ScholiaQ101124974MaRDI QIDQ3122907

Richard R. Weber, Peter W. Shor, Edward G. jun. Coffman, David S. Johnson

Publication date: 5 March 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v

zbMATH Keywords

average-case analysisbin packingfirst fitstochastic planar matching

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items

Average case analysis of bounded space bin packing algorithms, Order and static stability into the strip packing problem, On dynamic bin packing: An improved lower bound and resource augmentation analysis, Bin packing with directed stackability conflicts