A storage-size selection problem

DOI10.1016/0020-0190(84)90010-3zbMATH Open0542.68025OpenAlexW1997983719MaRDI QIDQ795502FDOQ795502

Michael A. Langston, Donald K. Friesen

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

approximation algorithmsbin packingworst-case analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

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

Cited In (5)

• A 71/60 theorem for bin packing
• Heuristic methods and applications: A categorized survey
• An on-line algorithm for variable-sized bin packing
• Online variable-sized bin packing
• Optimal allocation of storage space

   Recommendations

• Variable Sized Bin Packing 👍 👎
• Optimal Bin Packing with Items of Random Sizes II 👍 👎
• Online variable-sized bin packing 👍 👎
• Probabilistic behaviour of optimal bin-packing solutions 👍 👎
• Algorithms for the variable sized bin packing problem 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795502)