Cooper, Leon Heuristic methods for location-allocation problems. (English) Zbl 0956.90014 SIAM Rev. 6, 37-53 (1964). Summary: A number of heuristic algorithms have been devised for solving large location-allocation problems. The algorithms have been extensively tested and several are in use in at least one industrial corporation. It has been found that one of the algorithms, the random destination algorithm, appears to provide satisfactorily close approximations to the optimal solution to location-allocation problems in reasonable amounts of computation time. Cited in 4 ReviewsCited in 126 Documents MSC: 90B85 Continuous location 90C52 Methods of reduced gradient type PDF BibTeX XML Cite \textit{L. Cooper}, SIAM Rev. 6, 37--53 (1964; Zbl 0956.90014) Full Text: DOI OpenURL