Fast primal and dual heuristics for the p-median location problem

[1]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[2]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[3]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[4]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[5]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[6]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[7]  Pertti Järvinen,et al.  Technical Note - A Branch-and-Bound Algorithm for Seeking the P-Median , 1972, Oper. Res..

[8]  M. Rao,et al.  An Algorithm for the M-Median Plant Location Problem , 1974 .

[9]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[10]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[11]  Roberto Dieguez Galvao.  The optimal location of facilities on a network , 1977 .

[12]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[13]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[14]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .