Random-order bin packing

DOI10.1016/j.dam.2007.11.004zbMath1151.68048OpenAlexW2087514997MaRDI QIDQ948706

Edward G. jun. Coffman, Lajos Rónyai, Ambrus Zsbán, János A. Csirik

Publication date: 17 October 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.11.004

zbMATH Keywords

worst-case analysisbin packing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Online bin covering: expectations vs. guarantees ⋮ Relative Worst-Order Analysis: A Survey ⋮ A comparison of performance measures via online search ⋮ A comparison of performance measures for online algorithms ⋮ Best fit bin packing with random order revisited ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ Online Bin Covering: Expectations vs. Guarantees

Cites Work

• A stochastic model of bin-packing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random-order bin packing