Near-optimal heuristics for an assignment problem in mass storage
- 1 December 1975
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 4 (4) , 281-294
- https://doi.org/10.1007/bf00979370
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Near-Optimal Solutions to a 2-Dimensional Placement ProblemSIAM Journal on Computing, 1975
- On the Optimality of the Probability Ranking Scheme in Storage ApplicationsJournal of the ACM, 1973
- Mass storage: Past, present and futureComputer, 1973
- Placement of Records on a Secondary Storage Device to Minimize Access TimeJournal of the ACM, 1973
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangementsInformation and Control, 1972
- A Review of the Placement and Quadratic Assignment ProblemsSIAM Review, 1972
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962