Dominant, an algorithm for the p-center problem

European Journal of Operational Research

Volumn 149, Issue 1, 2003, Pages 53-64

  Caruso, C ^a,d   Colorni, A ^b   Aloi, L ^c  

^a CESI   (Italy)

^b POLITECNICO DI MILANO   (Italy)

^c ObjectWay spa   (Italy)

^d ACNielsen   (New Zealand)

Author keywords

Heuristics; Location; P Center; Set covering

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

SET COVERING PROBLEMS;

OPERATIONS RESEARCH;

EID: 0038221270     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00464-2     Document Type: Article

References (20)

1. Beasley J.E. A note on solving large p-median problems. European Journal of Operational Research. 21:1985;270-273.
2. Beasley J.E. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society. 41:1990;1069-1072.
3. Chandrasekaran R., Tamir A. Polynomially bounded algorithms for locating p-centers on a tree. Mathematical Programming. 22:1982;304-315.
4. Christofides N., Korman S. A computational survey of methods for the set covering problem. Management Science. 21:1975;591-599.
5. Daskin M.S. Network and Discrete Location: Models, Algorithms and Applications. 1995;John Wiley and Sons, Inc. New York.
6. Drezner Z. The p-center problem: Heuristic and optimal algorithms. Journal of the Operational Research Society. 35:1984;741-748.
7. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman & Company, New York.
8. Hakimi S.L. Optimal location of switching centers and the absolute centers and medians of a graph. Operations Research. 12:1964;450-459.
9. Handler G.Y. Finding two-centers of a tree: The continuos case. Transportation Science. 12:1978;93-106.
10. Handler G.Y. P-center Problems, in Discrete Location Theory. Mirchandani P.B., Francis R.L. 1990;305-347 John Wiley Inc. New York.
11. Handler G.Y., Mirchandani P.B. Location on Networks. 1979;M.I.T. Press, Cambridge, MA.
12. Ho A.C. Worst case analysis of a class of set covering heuristics. Mathematical Programming. 23:1982;170-180.
13. Jaeger M., Kariv I. Algorithms for finding p-centers on a weighted tree. Networks. 15:1985;381-389.
14. Kariv O., Hakimi S.L. An algorithmic approach to network location problems. Part 1. The p-centers. SIAM Journal on Applied Mathematics. 37:1979;513-538.
15. Klein C.M., Kincaid R.K. The discrete anti-p-center problem. Transportation Science. 28:1994;77-79.
16. Minieka E. The m-center problem. SIAM Review. 12:1970;138-139.
17. Minieka E. Conditional centers and medians on a graph. Networks. 10:1980;265-272.
18. Pelegrin B. Heuristic methods for the p-center problem. RAIRO Recherche Operationelle. 25:1991;65-72.
19. Vasko F.J., Wilson G.R. An efficient heuristic for large set covering problems. Naval Research Logistics Quarterly. 31:1984;163-171.
20. Vasko F.J., Wilson G.R. Hybrid heuristics for minimum cardinality set covering problems. Naval Research Logistics Quarterly. 33:1986;241-249.