A storage-size selection problem

DOI10.1016/0020-0190(84)90010-3MaRDI QIDQ795502zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsbin packingworst-case analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

Cites work

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

Cited in

(6)

• 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
• Variable-sized object packing and its applications to instruction cache design

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)