A maximal client coverage algorithm for the p-center problem

Thai Journal of Mathematics

Volumn 10, Issue 2, 2012, Pages 423-432

  Dantrakul, Sittipong ^a   Likasiri, Chulin ^a,b  

^a CHIANG MAI UNIVERSITY   (Thailand)

^b Thailand Ministry of Science and Technology   (Thailand)

Author keywords

Binary integer programming; Facility location problem; Greedy algorithm; p center problem; Set covering problem

Indexed keywords

EID: 84872532424     PISSN: 16860209     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. S.L. Hakimi, Optimum locations of switching centers and the absolute centers and medians of a graph, Operations Research 12 (1964) 450-459.
2. O. Kariv, S.L. Hakimi, An algorithmic approach to network location problems part I: the p-centers, SIAM Journal of Applied Mathematics 37 (1979) 513- 538.
3. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Thoeory of NP-Completeness, Bell Laboratories, Murray Hill, Freeman Co., N.J., 1978.
4. S. Olariu, A simple linear-time algorithm for computing the center of an interval graph, International Journal of Computer Mathematics 24 (1990) 121-128.
5. T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theoretical Comuter Science 38 (1985) 293-306.
6. S.D. Hochbaum, B.D. Shmoys, A best possible heuristic for the k-center problem, Mathematics of Operations Research 10 (1985) 180-184.
7. P. Hansen, N. Mladenovic, D. Perez-Brito, Variable neighborhood decomposition search, Journal of Heuristics 7 (2001) 335-350.
8. N. Mladenovic, M. Labbe, P. Hansen, Solving the p-center problem with tabu search and variable neighborhood search, Networks 42 (2003) 48-64.
9. S. Pallottino, M.P. Scappara, M.G. Scutellà, Large scale local search heuristics for the capacitated vertex p-center problem. Networks 43 (4) (2004) 241-255.
10. E. Minieka, The m-center problem, SIAM Rev. 12 (1970) 138-139.
11. M.S. Daskin, A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results, Communications of the Operations Research Society of Japan 45 (9) (2000) 428-436.
12. T. Ilhan, M.C. Pinar, An effcient exact algorithm for the vertex p-center problem, http://www.optimization-online.org/DBHTML/2001/09/376.html, 2001.
13. M. Jaeger, J. Goldberg, A polynomial algorithm for the equal capacity p-center problem on trees, Transportation Science 28 (1994) 167-175.
14. M. Bläser, Computing small partial coverings, Inf. Proc. Letters 85 (2003) 327-331.
15. F.A. Ozsoy, M.C. Pinar, An exact algorithm for the capacitated vertex p-center problem, Computers and Operations Research 33 (2006) 1420-1436.
16. M. Albareda-Sambola, J.A. Diaz, E. Fernandez, Lagrangean duals and exact solution to the capacitated p-center problem, European Journal of Operational Research 201 (2010) 71-81.