A p-center grid-positioning aggregation procedure

Computers and Operations Research

Volumn 26, Issue 10-11, 1999, Pages 1113-1124

  Rayco, M Brenda ^a   Francis, Richard L ^b   Tamir, Arie ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b University of Florida   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Aggregation; Location models; P center problem

Indexed keywords

ALGORITHMS; ERRORS; HEURISTIC METHODS; LOCATION; MATHEMATICAL MODELS; SET THEORY;

AGGREGATION; LOCATION MODELS;

OPTIMIZATION;

CLUSTER ANALYSIS; COMPUTER SYSTEM;

EID: 0033198096     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00019-2     Document Type: Article

References (18)

1. Bach L. The problem of aggregation and distance for analyses of accessibility and access opportunity in location- allocation models. Environment and Planning A 1981;13:955-78.
2. Casillas PA. Data aggregation and the p-median problem in continuous space. In: Ghosh, A, Rushton, G, editors, Spatial Analysis and Location Allocation Models. New York: Van Nostrand Reinhold Publishers, 1987:327-44.
3. Current JR, Schilling DA. Elimination of source A and source B errors in p-median location problems. Geographical Analysis 1987;19(2):95-110.
4. Current JR, Schilling DA. Analysis of errors due to demand data aggregation in the set covering and maximal covering location problems. Geographical Analysis 1990;22:116-26.
5. Francis RL, Lowe TJ, Rayco MB. Row-column aggregation for rectilinear distance p-median problems. Transportation Science 1996;30(2):160-74.
6. Goodchild MF. The aggregation problem in location-allocation. Geographical Analysis 1979;11(3):240-55.
7. Plastria F. Optimal gridpositioning or single facility location on the torus. Recherche Operationelle/Operations Research 1991;25(1):19-29.
8. Francis RL, Rayco MB. Asymptotically optimal aggregation for some unweighted p-center problems with rectilinear distances. Studies in Locational Analysis 1996;10:25-35.
9. Rayco MB, Francis RL, Lowe TJ. Error-bound driven demand point aggregation for the rectilinear distance p-center model. Location Science 1996;4:213-36.
10. Francis RL, Lowe TJ. On worst-case aggregation analysis for network location problems. Annals of Operations Research 1992;40:229-46.
11. Zemel E. Probabilistic analysis of geometric location problems. SIAM Journal on Algebraic and Discrete Methods 1985;6(2):189-200.
12. Masuyama S, Ibaraki T, Hasegawa T. The computational complexity of the m-center problems on the plane. The Transactions of the IECE of Japan 1981;E64(2):57-64.
13. Megiddo N, Supowit K. On the complexity of some common geometric location problems. SIAM Journal of Computing 1984;13:182-96.
14. Hakimi SL. Optimal locations of switching centers and the absolute centers and medians of a graph. Operations Research 1964;12:450-59.
15. Beckenbach E, Bellman R. An Introduction to Inequalities. New York: Random House, 1961.
16. Megiddo N, Tamir A. New results on the complexity of p-center problems. SIAM Journal of Computing 1983;12(4):751-7.
17. Cole R. Slowing down sorting networks to obtain faster sorting algorithms. Journal of ACM 1987;34:200-8.
18. Hassin R, Tamir A. On the minimum diameter spanning tree problem. Information Processing Letters 1995;53:109-11.