The P-center location problem in an area

Location Science

Volumn 4, Issue 1-2, 1996, Pages 69-82

  Suzuki, Atsuo ^a   Drezner, Zvi ^b  

^a NANZAN UNIVERSITY   (Japan)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

AMPL; P center problem; Voronoi diagram

Indexed keywords

LOCATION PROBLEM; P-CENTER PROBLEM; SPATIAL ANLAYSIS; VORONOI DIAGRAM;

EID: 0030417601     PISSN: 09668349     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0966-8349(96)00012-5     Document Type: Article

References (27)

1. Chandrasekaran, R. & Daughety, A. (1981) Location on tree networks: p-center and N-dispersion problems. Mathematics of Operations Research, 6, 50-57.
2. Chandrasekaran, R. & Tamir, A. (1982) Polynomial bounded algorithms for locating p-centers on a tree. Mathematical Pmgramming, 22,304-315.
3. Chen, R. & Handler, G. Y. (1987) A relaxation method for the solution of the minimax location-allocation problem in Euclidean space. Naval Research Logistics Quarterly, 34,775-778.
4. Cooper, L. (1963) Location-allocation problems. Operations Research, 11,331-343.
5. Cooper, L. (1964) Heuristic methods for location-allocation problems. SLAM Review, 6, 37-53.
6. Coxeter, H. S. M., Few, L. & Rogers, C. A. (1959) Covering space with equal spheres. Mathematics, 6,247.
7. Current, J. & O'Kelly, M. (1992) Locating emergency warning sirens. Decision Sciences, 23, 221-234.
8. Drezner, Z. (1984) The p-center problem-heuristic and optimal algorithms. Journal of the Opemtional Research Society, 35,741-148.
9. Drezner, Z. (1987) On the rectangular p-center problem. Naval Research Logistics Quarterly, 34,229-234.
10. Drezner, Z. & Erkut, E. (1995) Solving the continuous p-dispersion problem using non-linear programming. Journal of the Operational Research Society, 36, 516-520.
11. Drezner, Z. & Zemel, E. (1992) Competitive location in the plane. Annals of Operations Research, 40, 173-193.
12. Erkut, E. (1990) The discretep-dispersion problem. European Journal of Operational Research, 40,48-60.
13. Fourer, R., Gay, D. M. & Kemighan, B. W. (1993) AMPL A Modeling Language for Mathematical Programming. The Scientific Press, South San Francisco.
14. Handler, G. Y. (1990) "P-Center Problems", in Discrete Location Theory, P. Mirchandani & R. L. Francis (eds), New York, John Wiley & Sons.
15. Iri, M., Murota, K. & Ghya, T. (1984) A fast Voronoi diagram algorithm with applications to geographical optimization problems. Proceedings of the IFIP Conference on Svstem Modellinn and Optimization. 1983, Copenhagen, benmark. Also in S&tern Moa'elling and WOplimization,. Lecture Notes in Co&l and lnforkation Science, Vol. 59, pp. 273-288, P. Thoft-Christensen (ed.) Berlin, Springer-Verlag.
16. Kuby, M. J. (1987) Programming models for facility dispersion: the p-dispersion and maximum dispersion problem. Geographical Analysis, 19,315-329.
17. Ohya, T., Iri, M. Kc Murota, T. (1984) Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. Journal of the 0pemtion.s Research Society of Japan, 27, 306-337.
18. Okabe, A., Boots, B. & Sugihara, K. (1992) Spatial Tesselations-Concepts and Applications of Voronoi Diagrams. Chichester, John Wiley & Sons.
19. Okabe, A. & Suzuki, A. (1987) Stability in spatial competition for a large number of firms on a bounded twodimensional space. Environment and Planning A, 19,1067-1082.
20. Papadimitriou, C. H. (1981) Worst case and probabilistic analysis of a geometric location problem. SIAM Journal on Computing, 10,542.
21. Shier, D. R. (1977) A min-max theorem for p-center problems on a tree. Transportation Science, 11,243-252.
22. Sugihara, K. & Iri, M. (1992) Construction of the Voronoi diagram for "one million" generators in singleprecision arithmetic. Pmceedings ofthe IEEE, 80, 1471-1484.
23. Sugihara, K. & Iri, M. (1994) A robust topology-oriented incremental algorithm for Voronoi diagram. International Journal of Computational Geometry and Applications, 4, 179-228.
24. Suzuki, A. & Okabe, A. (1995) Using Voronoi diagrams. In Faciliry Location: A Survey of Applications and Methods, Z. Drezner (ed.). New York, Springer-Verlag.
25. Tansel, B. C., Francis, R. L. & Lowe, T. J. (1990) Duality: covering and constrainingp center problems on trees. In Discrete Location nteory, P. Mirchandani & R. L. Francis (eds). New York, John Wiley & Sons.
26. Vijay, J. (1985) An algorithm for the p-center problem in the plane. Transportation Science, 19, 235-245.
27. Zemel, E. (1984) Probabilistic analysis of geometric location problems. Annals of Operations Research, 1, 215-238.