Near-optimal heuristics for an assignment problem in mass storage
From MaRDI portal
Publication:4065020
DOI10.1007/BF00979370zbMath0307.68019MaRDI QIDQ4065020
No author found.
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
68N01: General topics in the theory of software
Related Items
Cites Work
- Near-Optimal Solutions to a 2-Dimensional Placement Problem
- On the Optimality of the Probability Ranking Scheme in Storage Applications
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
- A Review of the Placement and Quadratic Assignment Problems
- Placement of Records on a Secondary Storage Device to Minimize Access Time
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem