Near-optimal heuristics for an assignment problem in mass storage

DOI10.1007/BF00979370MaRDI QIDQ4065020zbMATH OpenOpenAlexFDO

Authors

Publication date 1975

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00979370

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites work

• A Review of the Placement and Quadratic Assignment Problems
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• Near-Optimal Solutions to a 2-Dimensional Placement Problem
• On the Optimality of the Probability Ranking Scheme in Storage Applications
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Placement of Records on a Secondary Storage Device to Minimize Access Time

Cited in

(1)

• Optimization and approximation algorithm for placement of records on linear storage devices

This page was built for publication: Near-optimal heuristics for an assignment problem in mass storage

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