A storage-size selection problem

DOI10.1016/0020-0190(84)90010-3zbMath0542.68025OpenAlexW1997983719MaRDI QIDQ795502

Donald K. Friesen, Michael A. Langston

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90010-3

zbMATH Keywords

worst-case analysisapproximation algorithmsbin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

A 71/60 theorem for bin packing ⋮ Online variable-sized bin packing ⋮ An on-line algorithm for variable-sized bin packing ⋮ Heuristic methods and applications: A categorized survey

Cites Work

• Fast algorithms for bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: A storage-size selection problem