References
- R.L. Church and C.S. Revelle, “Theoretical and computational links between the p-median, location set covering and the maximal covering location problem,” Geographical Analysis, 8, 1976, 406–15.
- G. Cornuejols, M.L. Fisher, G.L. Nemhauser, “Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms,” Management Science, 23, 1977, 789–810.
- D. Erlenkotter, “A dual based procedure for uncapacitated facility location,” Operations Research, 26, 1978, 992–1009.
- M.J. Hodgson, “Toward more realistic allocation in location-allocation models: an interaction approach,” Environment and Planning A, 10, 1978, 1273–85.
- P. Krolak, W. Felts, and G. Marble, “A man machine approach towards solving the travelling salesman problem,” Comm. ACM, 14, 1971, 327–34.
- A.A. Kuehn, and M.J. Hamburger, “A heuristic program for locating warehouses,” Management Science, 9, 1963, 643–66.
- J.M. Mulvey, and H.P. Crowder, “Cluster analysis: an application of lagrangian relaxation,” Management Science, 25, 1979, 329–40.
- R.M. Nauss, and R.E. Markland, “Theory and application of an optimizing procedure for lock box location analysis,” Management Science, 27, 1981, 855–65.
- K.E. Rosing, E.L. Hillsman, and H. Rosing-Vogelaar, “The robustness of two common heuristics for the p median problem,” Environment and Planning A, 11, 1979,373–80.
- G. Rushton, and J.A. Kohler, “ALLOC: heuristic solutions to multi-facility location problems on a graph,” in G. Rushton, M.C. Goodchild, and L.A. Ostresh, Jr, Computer Programs for Location-AllocationProblems. Department of Geography, Monograph No. 6, University of Iowa, 1973.
- M.B. Teitz, and P. Bart, “Heuristic methods for estimating the generalized vertex median of a weighted graph,” Operations Research, 16, 1968, 955–61.
- R.A. Whitaker, “Some interchange algorithms for median location problems,” Environment and Planning B, 9, 1982, 119–29.