Error-bound driven demand point aggregation for the rectilinear distance p-center model

Bach, 1981, The problem of aggregation and distance for analyses of accessibility and access opportunity in location-allocation models, Environment and Planning A, 13, 955, 10.1068/a130955 Beckenbach, 1961 Casillas, 1987, Data aggregation and the p-median problem in continuous space Current, 1987, Elimination of source A and source B errors in p-median location problems, Geographical Analysis, 19, 95, 10.1111/j.1538-4632.1987.tb00118.x Current, 1990, Analysis of errors due to demand data aggregation in the set covering and maximal covering location problems, Geographical Analysis, 22, 116, 10.1111/j.1538-4632.1990.tb00199.x Daskin, 1989, Aggregation effects in maximum covering models, Annals of Operations Research, 18, 115, 10.1007/BF02097799 Dearing, 1974, A network flow solution to a multifacility minimax location problem involving rectilinear distances, Transportation Science, 8, 126, 10.1287/trsc.8.2.126 Ezra, 1994, Solving infinite p-center problems in Euclidean space using an interactive graphical method, Location Science, 2, 101 Francis, 1971, A geometrical solution procedure for a rectilinear distance minimax location problem, AIIE Transactions, 4, 328, 10.1080/05695557208974870 Francis, 1992, On worst-case aggregation analysis for network location problems, Annals of Operations Research, 40, 229, 10.1007/BF02060479 Francis, 1996, Asymptotically optimal aggregation for some unweighted p-center problems with rectilinear distances, Studies in Locational Analysis, 10, 25 Francis, 1996, Row-column aggregation for rectilinear distance p-median problems, Transportation Science, 30, 160, 10.1287/trsc.30.2.160 Francis, 1992 Geoffrion, 1977, Objective function approximations in mathematical programming, Mathematical Programming, 13, 23, 10.1007/BF01584321 Goodchild, 1979, The aggregation problem in location-allocation, Geographical Analysis, 1, 240, 10.1111/j.1538-4632.1979.tb00692.x Hakimi, 1964, Optimal locations of switching centers and the absolute centers and medians of a graph, Operations Research, 12, 450, 10.1287/opre.12.3.450 Hakimi, 1965, Optimum distribution of switching centers in a communications network and some related graph-theoretic problems, Operations Research, 13, 462, 10.1287/opre.13.3.462 Halpern, 1976, The location of a center-median convex combination on an undirected tree, Journal of Regional Science, 16, 237, 10.1111/j.1467-9787.1976.tb00966.x Halpern, 1978, Finding minimal center-median convex combination (cent-dian) of a graph, Management Science, 24, 535, 10.1287/mnsc.24.5.535 Kariv, 1979, An algorithmic approach to network location problems Part 1: the p-centers, SIAM Journal of Applied Mathematics, 37, 513, 10.1137/0137040 Ko, 1990, Rectilinear m-center problem, Naval Research Logistics, 37, 419, 10.1002/nav.3800370306 Love, 1975, A computational procedure for the exact solution of location-allocation problems with rectangular distances, Naval Research Logistics, 22, 441, 10.1002/nav.3800220304 Masuyama, 1981, The computational complexity of the m-center problems on the plane, The Transactions of the IECE of Japan, E64, 57 Megiddo, 1984, On the complexity of some common geometric location problems, SIAM Journal on Computing, 13, 182, 10.1137/0213014 Megiddo, 1981, An O(n log2 n) algorithm for the kth longest path in a tree with applications to location problems, SIAM Journal on Computing, 10, 328, 10.1137/0210023 Plastria, 1991, Optimal gridpositioning or single facility location on the torus, Recherche operationellel Operations Research, 25, 19, 10.1051/ro/1991250100191 Rayco, 1996, Algorithmic approaches to demand point aggregation for location models Rogers, 1991, Aggregation and disaggregation techniques and methodology in optimization, Operations Research, 39, 553, 10.1287/opre.39.4.553 Wendell, 1973, Location theory, dominance, and convexity, Operations Research, 21, 314, 10.1287/opre.21.1.314 Zemel, 1985, Probabilistic analysis of geometric location problems, SIAM Journal on Algebraic and Discrete Methods, 6, 189, 10.1137/0606017