Enhancements to two exact algorithms for solving the vertex P-center problem

Journal of Mathematical Modelling and Algorithms

Volumn 4, Issue 2, 2005, Pages 129-147

  Al Khedhairi, A ^a   Salhi, S ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

0 1 programming; Location; P center

Indexed keywords

EID: 21244450361     PISSN: 15701166     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10852-004-4072-3     Document Type: Article

References (12)

1. Beasley, J. E.: A note on solving large P-median problems, European J. Oper. Res. 21 (1985), 270-273.
2. Beasley, J. E.: OR library: Distributing test problems by electronic mail, J. Oper. Res. Soc. 41(11) (1990), 1069-1072.
3. Daskin, M. S.: Network and Discrete Locations: Models, Algorithms, and Applications, Wiley, New York, 1995, pp. 154-191.
4. Daskin, M.: A new approach to solve the vertex P -center problem to optimality: Algorithm and computational results, Comm. Open Res. Soc. Japan 45(9) (2000), 428-436.
5. Elloumi, S., Labbé, M. and Pochet, Y.: New formulation and resolution method for the P-center problem, http://www.optimization-online.org/DB.HTML/2001/10/394.html, 2001.
6. Floyd, R.W.: Algorithm 97, Shortest Path, Comm. Assoc. Comput. Mach. 5 (1962), 345.
7. Hakimi, S. L.: Optimum locations of switching centers and the absolute centers and medians of a graph, Oper. Res. 12 (1964), 450-459.
8. Hakimi, S. L.: Optimum distribution of switching centers in a communications network and some related graph theoretic problems, Oper. Res. 13 (1965), 462-475.
9. Ilhan, T. and Pinar, M.C.: An efficient exact algorithm for the vertex P-center problem, http: //www.optimization-online.org/DB .HTML/200 l/09/376.html, 2001.
10. Kariv, O. and Hakimi, S.: An algorithmic approach to network location problems. Part I: The P-centers, SIAM J. Appl. Math. 37 (1979), 513-538.
11. Minieka, E.: The m-center problem, SIAM Rev. 12(1970), 138-139.
12. Reinelt, G.: TSPLIB - A traveling salesman problem library, ORSA J. Comput. 3 (1991), 376-384.