A comparison of two dual-based procedures for solving the p-median problem

Abstract We compare two dual-based procedures for solving the p -median problem. They rely upon alternative Lagrangean relaxations of the problem. We describe the algorithms and report on our computational experiments.

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

[2]  M. L. Fisher,et al.  Probabilistic Analysis of the Planar k-Median Problem , 1980, Math. Oper. Res..

[3]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

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

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

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

[7]  Nicos Christofides,et al.  A tree search algorithm for the p-median problem , 1982 .

[8]  R. A. Whitaker A Tight Bound Drop Exchange Algorithm for Solving the p Median Problem , 1981 .

[9]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[10]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[11]  S. Hakimi Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

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

[13]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

[14]  H. Sherali,et al.  On the choice of step size in subgradient optimization , 1981 .

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

[16]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[17]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[18]  Pierre Hansen,et al.  Programmes mathématiques en variables 0-1 , 1974 .

[19]  Gérard Cornuéjols,et al.  Some facets of the simple plant location polytope , 1982, Math. Program..

[20]  R. Swain A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems , 1974 .

[21]  Pierre Hansen,et al.  The simple plant location problem , 1976 .

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

[23]  A. M. El-Shaieb,et al.  A New Algorithm for Locating Sources Among Destinations , 1973 .

[24]  A. Kolen Solving covering problems and the uncapacitated plant location problem on trees , 1983 .

[25]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[26]  B. M. Khumawala An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[27]  D. Erlenkotter Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public , 1977 .

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

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

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

[31]  Harvey J. Greenberg Technical Note - The One-Dimensional Generalized Lagrange Multiplier Problem , 1977, Oper. Res..

[32]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[33]  L. Schrage Implicit representation of variable upper bounds in linear programming , 1975 .

[34]  G. Leonardi The Use of Random-Utility Theory in Building Location-Allocation Models , 1981 .