New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems

We present new relaxation algorithms for the uncapacitated continuous and discrete p-center problems. We have conducted an experimental study that demonstrated that these new algorithms are extremely efficient.

[1]  Pierre Hansen,et al.  Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search , 2000, Networks.

[2]  Dorit S. Hochbaum,et al.  When are NP-hard location problems easy? , 1984, Ann. Oper. Res..

[3]  C. D. T. Watson-Gandy,et al.  The multi-facility min-max Weber problem , 1984 .

[4]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[5]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[6]  H. Rademacher,et al.  16. The Spanning Circle of a Finite Set of Points , 1957 .

[7]  A. Colorni,et al.  Dominant, an algorithm for the p-center problem , 2003, Eur. J. Oper. Res..

[8]  Micha Sharir,et al.  Efficient algorithms for geometric optimization , 1998, CSUR.

[9]  J. Beasley.  A note on solving large p-median problems , 1985 .

[10]  Pitu B. Mirchandani,et al.  Location on networks : theory and algorithms , 1979 .

[11]  E. Minieka.  The m-Center Problem , 1970 .

[12]  Zvi Drezner,et al.  The Planar Two-Center and Two-Median Problems , 1984, Transp. Sci..

[13]  Reuven Chen.  Solution of minisum and minimax location–allocation problems with Euclidean distances , 1983 .

[14]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[15]  Mark S. Daskin,et al.  3 Discrete Network Location Models , 2001 .

[16]  James Vijay,et al.  An Algorithm for the p-Center Problem in the Plane , 1985, Transp. Sci..

[17]  Trevor S. Hale,et al.  Location Science Research: A Review , 2003, Ann. Oper. Res..

[18]  Chrystal.  On the problem to construct the minimum circle enclosing n given points in a plane , 1884 .

[19]  Richard C. T. Lee,et al.  The slab dividing approach to solve the EuclideanP-Center problem , 2005, Algorithmica.

[20]  Martine Labbé,et al.  A New Formulation and Resolution Method for the p-Center Problem , 2004, INFORMS J. Comput..

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

[22]  Alan T. Murray,et al.  Solving the continuous space p-centre problem: planning application issues , 2006 .

[23]  G. Y. Handler,et al.  Relaxation method for the solution of the minimax location-allocation problem in Euclidean space , 1987 .

[24]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[25]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[26]  Z. Drezner,et al.  The p-center location problem in an area , 1996 .

[27]  C. O. Oakley,et al.  The Enjoyment of Mathematics. , 1957 .