{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:23:36Z","timestamp":1785954216835,"version":"3.56.0"},"reference-count":107,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T00:00:00Z","timestamp":1207612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10479-008-0344-z","type":"journal-article","created":{"date-parts":[[2008,4,7]],"date-time":"2008-04-07T15:57:11Z","timestamp":1207583831000},"page":"171-208","source":"Crossref","is-referenced-by-count":92,"title":["Aggregation error for location models: survey\u00a0and\u00a0analysis"],"prefix":"10.1007","volume":"167","author":[{"given":"R. L.","family":"Francis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. J.","family":"Lowe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. B.","family":"Rayco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,4,8]]},"reference":[{"key":"344_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"P. K. Agarwal","year":"2002","unstructured":"Agarwal, P. K., & Procopiuc, C. M. (2002). Exact and approximation algorithms for clustering. Algorithmica, 33, 201\u2013226.","journal-title":"Algorithmica"},{"key":"344_CR2","unstructured":"Agarwal, P. K., & Varadarajan, K. R. (1999). Approximation algorithms for bipartite and nonbipartite matchings in the plane, In 10th ACM-SIAM symposium on discrete algorithms (SODA), pp. 805\u2013814."},{"key":"344_CR3","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"P. K. Agarwal","year":"1999","unstructured":"Agarwal, P. K., Efrat, A., & Sharir, M. (1999). Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM Journal on Computing, 29, 912\u2013953.","journal-title":"SIAM Journal on Computing"},{"key":"344_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, P. K., Procopiuc, C. M., & Varadarajan, K. R. (2002). Approximation algorithms for k-line center, In Proceedings 10-th annual European symposium on algorithms (ESA 2002), pp. 54\u201363.","DOI":"10.1007\/3-540-45749-6_9"},{"key":"344_CR5","volume-title":"Combinatorial and computational geometry","author":"P. K. Agarwal","year":"2005","unstructured":"Agarwal, P. K., Har-Peled, S., & Varadarajan, K. R. (2005). Geometric approximation via coresets. In J. E. Goodman, J. Pach, & E. Welzl (Eds.), Combinatorial and computational geometry. New York: Cambridge University Press."},{"key":"344_CR6","volume-title":"Network flows: theory, algorithms, and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice\u2013Hall (Exercise 12.23 on page 505 describes an O(n2.5 log n) algorithm for the bottleneck assignment problem.)"},{"key":"344_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0966-8349(98)00045-X","volume":"6","author":"G. Andersson","year":"1998","unstructured":"Andersson, G., Francis, R. L., Normark, T., & Rayco, M. B. (1998). Aggregation method experimentation for large-scale network location problems. Location Science, 6, 25\u201339.","journal-title":"Location Science"},{"key":"344_CR8","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1068\/a130955","volume":"13","author":"L. Bach","year":"1981","unstructured":"Bach, L. (1981). The problem of aggregation and distance for analysis of accessibility and access opportunity in location-allocation models. Environment and Planning A, 13, 955\u2013978.","journal-title":"Environment and Planning A"},{"key":"344_CR9","first-page":"49","volume":"33","author":"R. H. Ballou","year":"1994","unstructured":"Ballou, R. H. (1994). Measuring transport costing error in customer aggregation for facility location. Transportation Journal, 33, 49\u201354.","journal-title":"Transportation Journal"},{"key":"344_CR10","volume-title":"Facility location: applications and theory","author":"T. Bender","year":"2001","unstructured":"Bender, T., Hennes, H., Kalcsics, J., Melo, T., & Nickel, S. (2001). Location software and interface with GIS and supply chain management. In Z. Drezner & H. Hamacher (Eds.), Facility location: applications and theory. Berlin: Springer."},{"key":"344_CR11","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(99)00020-9","volume":"26","author":"R. L. Bowerman","year":"1999","unstructured":"Bowerman, R. L., Calamai, P. H., & Hall, B. (1999). The demand partitioning method for reducing aggregation errors in p-median problems. Computers and Operations Research, 26, 1097\u20131111.","journal-title":"Computers and Operations Research"},{"key":"344_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1008395305189","volume":"18","author":"E. Carrizosa","year":"2000","unstructured":"Carrizosa, E., Hamacher, H. W., Nickel, S., & Klein, R. (2000). Solving nonconvex planar location problems by finite dominating sets. Journal of Global Optimization, 18, 195\u2013210.","journal-title":"Journal of Global Optimization"},{"key":"344_CR13","first-page":"227","volume-title":"Spatial analysis and location-allocation models","author":"P. A. Casillas","year":"1987","unstructured":"Casillas, P. A. (1987). Data aggregation and the p-median problem in continuous space. In A. Ghosh & G. Rushton (Eds.), Spatial analysis and location-allocation models (pp. 227\u2013244). New York: Van Nostrand Reinhold Publishers."},{"key":"344_CR14","first-page":"5","volume":"2","author":"K. R. Chelst","year":"1988","unstructured":"Chelst, K. R., Schultz, J. P., & Sanghvi, N. (1988). Issues and decision aids for designing branch networks. Journal of Retail Banking X, 2, 5\u201317.","journal-title":"Journal of Retail Banking X"},{"key":"344_CR15","first-page":"334","volume":"1","author":"L. Cooper","year":"1967","unstructured":"Cooper, L. (1967). Solutions of generalized location equilibrium models. Journal of Regional Science, 1, 334\u2013336.","journal-title":"Journal of Regional Science"},{"key":"344_CR16","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977). Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms. Management Science, 23, 789\u2013810.","journal-title":"Management Science"},{"key":"344_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1111\/j.1538-4632.1987.tb00118.x","volume":"19","author":"J. R. Current","year":"1987","unstructured":"Current, J. R., & Schilling, D. A. (1987). Elimination of source A and B errors in p-median problems. Geographical Analysis, 19, 95\u2013110.","journal-title":"Geographical Analysis"},{"key":"344_CR18","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1111\/j.1538-4632.1990.tb00199.x","volume":"22","author":"J. R. Current","year":"1990","unstructured":"Current, J. R., & Schilling, D. A. (1990). Analysis of errors due to demand data aggregation in the set covering and maximal covering location problems. Geographical Analysis, 22, 116\u2013126.","journal-title":"Geographical Analysis"},{"key":"344_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and discrete location: models, algorithms, and applications","author":"M. S. Daskin","year":"1995","unstructured":"Daskin, M. S. (1995). Network and discrete location: models, algorithms, and applications. New York: Wiley."},{"key":"344_CR20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02097799","volume":"18","author":"M. S. Daskin","year":"1989","unstructured":"Daskin, M. S., Haghani, A. E., Khanal, M., & Malandraki, C. (1989). Aggregation effects in maximum covering models. Annals of Operations Research, 18, 115\u2013139.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"344_CR21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/inte.1050.0127","volume":"35","author":"J. Dekle","year":"2005","unstructured":"Dekle, J., Lavieri, M., Martin, E., Emir-Farinas, H., & Francis, R. L. (2005). A Florida county locates disaster recovery centers. Interfaces, 35(2), 133\u2013139.","journal-title":"Interfaces"},{"key":"344_CR22","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1287\/mnsc.37.8.960","volume":"37","author":"P. D. Domich","year":"1991","unstructured":"Domich, P. D., Hoffman, K. L., Jackson, R. H. F., & McClain, M. A. (1991). Locating tax facilities: a graphics-based microcomputer optimization model. Management Science, 37, 960\u2013979.","journal-title":"Management Science"},{"key":"344_CR23","volume-title":"Facility location: a survey of applications and methods","year":"1995","unstructured":"Drezner, Z. (Ed.). (1995a). Facility location: a survey of applications and methods. Berlin: Springer."},{"key":"344_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5355-6","volume-title":"Facility location: a survey of applications and methods","author":"Z. Drezner","year":"1995","unstructured":"Drezner, Z. (1995b). Replacing discrete demand with continuous demand. In Z. Drezner (Ed.), Facility location: a survey of applications and methods. Berlin: Springer."},{"key":"344_CR25","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<81::AID-NAV5>3.0.CO;2-I","volume":"44","author":"T. Drezner","year":"1997","unstructured":"Drezner, T., & Drezner, Z. (1997). Replacing discrete demand with continuous demand in a competitive facility location problem. Naval Research Logistics, 44, 81\u201395.","journal-title":"Naval Research Logistics"},{"key":"344_CR26","volume-title":"Facility location: theory and algorithms","year":"2002","unstructured":"Drezner, Z., & Hamacher, H. W. (Eds.). (2002). Facility location: theory and algorithms. Berlin: Springer."},{"key":"344_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A. Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., & Katz, M. J. (2001). Geometry helps in bottleneck matching and related problems. Algorithmica, 31, 1\u201328.","journal-title":"Algorithmica"},{"key":"344_CR28","unstructured":"Emir-Farinas, H. (2002). Aggregation of demand points for the planar covering location problem. Ph. D. Dissertation, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL."},{"key":"344_CR29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10479-005-2044-2","volume":"136","author":"H. Emir-Farinas","year":"2005","unstructured":"Emir-Farinas, H., & Francis, R. L. (2005). Demand point aggregation for planar covering location models. Annals of Operations Research, 136, 175\u2013192.","journal-title":"Annals of Operations Research"},{"key":"344_CR30","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1016\/S0305-0548(99)00021-0","volume":"26","author":"E. Erkut","year":"1999","unstructured":"Erkut, E., & Bozkaya, B. (1999). Analysis of aggregation errors for the p-median problem. Computers and Operations Research, 26, 1075\u20131096.","journal-title":"Computers and Operations Research"},{"key":"344_CR31","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E. Erkut","year":"1989","unstructured":"Erkut, E., & Neuman, S. (1989). Analytical models for locating undesirable facilities. European Journal of Operational Research, 40, 275\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"344_CR32","unstructured":"Ernst, A., Hamacher, H. W., Jiang, H. W., Krishnamorthy, M., & Woeginger, G. (2002a). Uncapacitated single and multiple allocation p-hub center problems. Report CSIRO, Melbourne, Australia."},{"key":"344_CR33","unstructured":"Ernst, A., Hamacher, H. W., Jiang, H. W., Krishnamorthy, M., & Woeginger, G. (2002b). Heuristic algorithms for the uncapacitated hub center single allocation problem. Report CSIRO, Melbourne, Australia."},{"key":"344_CR34","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1012545106828","volume":"1","author":"J. Fortney","year":"2000","unstructured":"Fortney, J., Rost, K., & Warren, J. (2000). Comparing alternative methods of measuring geographic access to health services. Health Services and Outcomes Research Methodology, 1, 173\u2013184.","journal-title":"Health Services and Outcomes Research Methodology"},{"key":"344_CR35","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1111\/j.1538-4632.1995.tb00336.x","volume":"27","author":"A. S. Fotheringham","year":"1995","unstructured":"Fotheringham, A. S., Densham, P., & Curtis, A. (1995). The zone definition problem in location-allocation modeling. Geographical Analysis, 27, 60\u201377.","journal-title":"Geographical Analysis"},{"key":"344_CR36","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02060479","volume":"40","author":"R. L. Francis","year":"1992","unstructured":"Francis, R. L., & Lowe, T. J. (1992). On worst-case aggregation analysis for network location problems. Annals of Operations Research, 40, 229\u2013246.","journal-title":"Annals of Operations Research"},{"key":"344_CR37","first-page":"25","volume":"10","author":"R. L. Francis","year":"1996","unstructured":"Francis, R. L., & Rayco, M. B. (1996). Asymptotically optimal aggregation for some unweighted p-center problems with rectilinear distances. Studies in Locational Analysis, 10, 25\u201336.","journal-title":"Studies in Locational Analysis"},{"key":"344_CR38","volume-title":"Facility layout and location: an analytical approach","author":"R. L. Francis","year":"1974","unstructured":"Francis, R. L., & White, J. A. (1974). Facility layout and location: an analytical approach. Englewood Cliffs: Prentice\u2013Hall (Homework problem 7.25, p. 324)."},{"key":"344_CR39","volume-title":"Facility layout and location: an analytical approach","author":"R. L. Francis","year":"1992","unstructured":"Francis, R. L., McGinnis, L. F., & White, J. A. (1992). Facility layout and location: an analytical approach (2nd ed.). Englewood Cliffs: Prentice\u2013Hall.","edition":"2"},{"key":"344_CR40","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1287\/trsc.30.2.160","volume":"30","author":"R. L. Francis","year":"1996","unstructured":"Francis, R. L., Lowe, T. J., & Rayco, M. B. (1996). Row-column aggregation for rectilinear p-median problems. Transportation Science, 30, 160\u2013174.","journal-title":"Transportation Science"},{"key":"344_CR41","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1111\/gean.1999.31.1.67","volume":"31","author":"R. L. Francis","year":"1999","unstructured":"Francis, R. L., Lowe, T. J., Rushton, G., & Rayco, M. B. (1999). A synthesis of aggregation methods for multi-facility location problems: strategies for containing error. Geographical Analysis, 31, 67\u201387.","journal-title":"Geographical Analysis"},{"key":"344_CR42","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/opre.48.2.294.12382","volume":"48","author":"R. L. Francis","year":"2000","unstructured":"Francis, R. L., Lowe, T. J., & Tamir, A. (2000). On aggregation error bounds for a class of location models. Operations Research, 48, 294\u2013307.","journal-title":"Operations Research"},{"key":"344_CR43","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.10021","volume":"39","author":"R. L. Francis","year":"2002","unstructured":"Francis, R. L., Lowe, T. J., & Tamir, A. (2002a). Worst-case incremental analysis for a class of p-facility location problems. Networks, 39, 139\u2013143.","journal-title":"Networks"},{"key":"344_CR44","volume-title":"Facility location: applications and theory","author":"R. L. Francis","year":"2002","unstructured":"Francis, R. L., Lowe, T. J., & Tamir, A. (2002b). Demand point aggregation of location models. In Z. Drezner & H. Hamacher (Eds.), Facility location: applications and theory. Berlin: Springer."},{"key":"344_CR45","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1002\/nav.10079","volume":"50","author":"R. L. Francis","year":"2003","unstructured":"Francis, R. L., Lowe, T. J., Rayco, M. B., & Tamir, A. (2003). Exploiting self-canceling demand point aggregation error for some planar rectilinear median problems. Naval Research Logistics, 50, 614\u2013637.","journal-title":"Naval Research Logistics"},{"key":"344_CR46","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1080\/07408170490278210","volume":"36","author":"R. L. Francis","year":"2004","unstructured":"Francis, R. L., Lowe, T. J., & Tamir, A. (2004a). Demand point aggregation analysis for a class of constrained location models: a penalty function approach. IIE Transactions, 36, 601\u2013609.","journal-title":"IIE Transactions"},{"key":"344_CR47","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1111\/j.1538-4632.2004.tb01140.x","volume":"36","author":"R. L. Francis","year":"2004","unstructured":"Francis, R. L., Lowe, T. J., Tamir, A., & Emir-Farinas, H. (2004b). Aggregation decomposition and aggregation guidelines for a class of minimax and covering location models. Geographical Analysis, 36, 332\u2013349.","journal-title":"Geographical Analysis"},{"key":"344_CR48","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/S0377-2217(03)00433-8","volume":"159","author":"R. L. Francis","year":"2004","unstructured":"Francis, R. L., Lowe, T. J., Tamir, A., & Emir-Farinas, H. (2004c). A framework for demand point and solution space aggregation analysis for location models. European Journal of Operational Research, 159, 574\u2013585.","journal-title":"European Journal of Operational Research"},{"key":"344_CR49","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0166-218X(80)90026-8","volume":"10","author":"A. M. Frieze","year":"1980","unstructured":"Frieze, A. M. (1980). Probabilistic analysis of some Euclidean clustering problems. Discrete Applied Mathematics, 10, 295\u2013309.","journal-title":"Discrete Applied Mathematics"},{"key":"344_CR50","unstructured":"Gavriliouk, E. O. (2003). Aggregation in hub location models. M. Sc. Thesis, Department of Mathematics, Clemson University, Clemson, SC."},{"key":"344_CR51","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584321","volume":"13","author":"A. Geoffrion","year":"1977","unstructured":"Geoffrion, A. (1977). Objective function approximations in mathematical programming. Mathematical Programming, 13, 23\u201337.","journal-title":"Mathematical Programming"},{"key":"344_CR52","volume-title":"Methods of real analysis","author":"R. Goldberg","year":"1976","unstructured":"Goldberg, R. (1976). Methods of real analysis (2nd ed.). New York: Wiley.","edition":"2"},{"key":"344_CR53","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.1538-4632.1979.tb00692.x","volume":"11","author":"M. F. Goodchild","year":"1979","unstructured":"Goodchild, M. F. (1979). The aggregation problem in location-allocation. Geographical Analysis, 11, 240\u2013255.","journal-title":"Geographical Analysis"},{"key":"344_CR54","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S. L. Hakimi","year":"1965","unstructured":"Hakimi, S. L. (1965). Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research, 12, 450\u2013459.","journal-title":"Operations Research"},{"key":"344_CR55","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.4.4.412","volume":"4","author":"S. L. Hakimi","year":"1992","unstructured":"Hakimi, S. L., Labbe\u2019, M., & Schmeichel, E. (1992). The Voronoi partitioning of a network and its implications in network location theory. ORSA Journal on Computing, 4, 412\u2013417.","journal-title":"ORSA Journal on Computing"},{"key":"344_CR56","first-page":"133","volume":"7","author":"T. Hale","year":"2000","unstructured":"Hale, T., & Hale, L. (2000). An aggregation technique for location problems with one-dimensional forbidden regions. International Journal of Industrial Engineering, 7, 133\u2013139.","journal-title":"International Journal of Industrial Engineering"},{"key":"344_CR57","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"T. Hale","year":"2003","unstructured":"Hale, T., & Moberg, C. (2003). Location science research: a review. Annals of Operations Research, 123, 21\u201335.","journal-title":"Annals of Operations Research"},{"key":"344_CR58","first-page":"129","volume":"6","author":"T. Hale","year":"2000","unstructured":"Hale, T., Wysk, R., & Smith, D. (2000). A gross aggregation technique for the p-median location problem. International Journal of Operations and Quantitative Management, 6, 129\u2013135.","journal-title":"International Journal of Operations and Quantitative Management"},{"key":"344_CR59","volume-title":"Location on networks: theory and algorithms","author":"G. Y. Handler","year":"1979","unstructured":"Handler, G. Y., & Mirchandani, P. B. (1979). Location on networks: theory and algorithms. Cambridge: MIT Press."},{"key":"344_CR60","volume-title":"Facility location: a survey of applications and methods","author":"P. Hansen","year":"1995","unstructured":"Hansen, P., Jaumard, B., & Tuy, H. (1995). Global optimization in location. In Z. Drezner (Ed.), Facility location: a survey of applications and methods. Berlin: Springer."},{"key":"344_CR61","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s00454-004-2822-7","volume":"31","author":"S. Har-Peled","year":"2004","unstructured":"Har-Peled, S. (2004a). Clustering motion. Discrete Computational Geometry, 31, 545\u2013565.","journal-title":"Discrete Computational Geometry"},{"key":"344_CR62","doi-asserted-by":"crossref","unstructured":"Har-Peled, S. (2004b). No coreset, no cry. In Proceedings 24-th conf. found. soft. tech. theoretical computer science, pp. 324\u2013335.","DOI":"10.1007\/978-3-540-30538-5_27"},{"key":"344_CR63","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00454-006-1271-x","volume":"37","author":"S. Har-Peled","year":"2007","unstructured":"Har-Peled, S., & Kushal, A. (2007). Smaller coresets for k-median and k-means clustering. Discrete Computational Geometry, 37, 3\u201319.","journal-title":"Discrete Computational Geometry"},{"key":"344_CR64","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., & Mazumdar, S. (2004). Coresets for k-means and k-median clustering and their applications. In Proceedings 36-th annual ACM symposium on theory of computing, pp. 291\u2013300.","DOI":"10.1145\/1007352.1007400"},{"key":"344_CR65","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0167-6377(91)90041-M","volume":"10","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., & Tamir, A. (1991). Improved complexity bounds for location problems on the real line. O.R. Letters, 10, 395\u2013402.","journal-title":"O.R. Letters"},{"key":"344_CR66","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF01286124","volume":"12","author":"E. L. Hillsman","year":"1978","unstructured":"Hillsman, E. L., & Rhoda, R. (1978). Errors in measuring distances from populations to service centers. Annals of Regional Science, 12, 74\u201388.","journal-title":"Annals of Regional Science"},{"key":"344_CR67","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1020771702141","volume":"110","author":"M. J. Hodgson","year":"2002","unstructured":"Hodgson, M. J. (2002). Data surrogation error in p-median models. Annals of Operations Research, 110, 153\u2013165.","journal-title":"Annals of Operations Research"},{"key":"344_CR68","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/A:1026115027615","volume":"123","author":"M. J. Hodgson","year":"2003","unstructured":"Hodgson, M. J., & Hewko, J. (2003). Aggregation and surrogation error in the p-median model. Annals of Operations Research, 123, 53\u201366.","journal-title":"Annals of Operations Research"},{"key":"344_CR69","first-page":"155","volume":"1","author":"M. J. Hodgson","year":"1993","unstructured":"Hodgson, M. J., & Neuman, S. (1993). A GIS approach to eliminating source C aggregation error in p-median models. Location Science, 1, 155\u2013170.","journal-title":"Location Science"},{"key":"344_CR70","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1111\/j.1541-0064.1997.tb01324.x","volume":"41","author":"M. J. Hodgson","year":"1997","unstructured":"Hodgson, M. J., Shmulevitz, F., & K\u00f6rkel, M. (1997). Aggregation error effects on the discrete-space p-median model: the case of Edmonton, Canada. The Canadian Geographer, 41, 415\u2013428.","journal-title":"The Canadian Geographer"},{"key":"344_CR71","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.39.1.100","volume":"39","author":"J. N. Hooker","year":"1991","unstructured":"Hooker, J. N., Garfinkel, R. S., & Chen, C. K. (1991). Finite dominating sets for network location problems. Operations Research, 39, 100\u2013118.","journal-title":"Operations Research"},{"key":"344_CR72","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., & Hakimi, S. L. (1979). An algorithmic approach to network location problems: part 1, the p-centers; part 2, the p-medians. SIAM Journal of Applied Mathematics, 37, 513\u2013560.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"344_CR73","first-page":"263","volume-title":"Discrete location theory","author":"A. Kolen","year":"1990","unstructured":"Kolen, A., & Tamir, A. (1990). Covering problems. In P. B. Mirchandani & R. L. Francis (Eds.), Discrete location theory (pp. 263\u2013304). New York: Wiley\u2013Interscience."},{"key":"344_CR74","volume-title":"Facility location: models and methods","author":"R. Love","year":"1988","unstructured":"Love, R., Morris, J., & Wesolowsky, G. (1988). Facility location: models and methods. Amsterdam: North-Holland."},{"key":"344_CR75","first-page":"387","volume":"17","author":"A. Marchetti-Spaccamela","year":"1983","unstructured":"Marchetti-Spaccamela, A., & Talamo, M. (1983). Probabilistic analysis of two Euclidean location problems. R.A.I.R.O. Informatique Theorique\/Theoretical Informatics, 17, 387\u2013395.","journal-title":"R.A.I.R.O. Informatique Theorique\/Theoretical Informatics"},{"key":"344_CR76","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13, 182\u2013196.","journal-title":"SIAM Journal on Computing"},{"key":"344_CR77","volume-title":"Discrete location theory","year":"1990","unstructured":"Mirchandani, P. B., & Francis, R. L. (Eds.). (1990). Discrete location theory. New York: Wiley\u2013Interscience."},{"key":"344_CR78","first-page":"329","volume":"10","author":"P. B. Mirchandani","year":"1986","unstructured":"Mirchandani, P. B., & Reilly, J. M. (1986). Spatial nodes in discrete location problems. Annals of Operations Research, 10, 329\u2013350.","journal-title":"Annals of Operations Research"},{"key":"344_CR79","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1111\/j.1538-4632.1997.tb00957.x","volume":"29","author":"A. T. Murray","year":"1997","unstructured":"Murray, A. T., & Gottsegen, J. M. (1997). The influence of data aggregation on the stability of p-median location model solutions. Geographical Analysis, 29, 200\u2013213.","journal-title":"Geographical Analysis"},{"key":"344_CR80","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.0.CO;2-2","volume":"34","author":"S. Nickel","year":"1999","unstructured":"Nickel, S., & Puerto, J. (1999). A unified approach to network location problems. Networks, 34, 283\u2013290.","journal-title":"Networks"},{"key":"344_CR81","volume-title":"Location theory: a unified approach","author":"S. Nickel","year":"2005","unstructured":"Nickel, S., & Puerto, J. (2005). Location theory: a unified approach. Berlin: Springer."},{"key":"344_CR82","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1111\/j.1538-4632.1991.tb00221.x","volume":"23","author":"Y. Ohsawa","year":"1991","unstructured":"Ohsawa, Y., Koshizuka, T., & Kurita, O. (1991). Errors caused by rounded data in two simple facility location problems. Geographical Analysis, 23, 56\u201373.","journal-title":"Geographical Analysis"},{"key":"344_CR83","volume-title":"Handbook of applied optimization","year":"2002","unstructured":"Pardalos, P. M., & Resende, M. (Eds.). (2002). Handbook of applied optimization. Oxford: Oxford University Press."},{"key":"344_CR84","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0377-2217(92)90244-4","volume":"62","author":"F. Plastria","year":"1992","unstructured":"Plastria, F. (1992). GBSSS: the generalized big square small square method for planar single-facility location. European Journal of Operational Research, 62, 163\u2013174.","journal-title":"European Journal of Operational Research"},{"key":"344_CR85","first-page":"101","volume":"14","author":"F. Plastria","year":"2000","unstructured":"Plastria, F. (2000). New error bounds in continuous minisum location for aggregation at the gravity centre. Studies in Locational Analysis, 14, 101\u2013119.","journal-title":"Studies in Locational Analysis"},{"key":"344_CR86","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02579084","volume":"9","author":"F. Plastria","year":"2001","unstructured":"Plastria, F. (2001). On the choice of aggregation points for continuous p-median problems: a case for the gravity center. TOP, 9, 217\u2013242.","journal-title":"TOP"},{"key":"344_CR87","first-page":"321","volume":"1","author":"J. Puerto","year":"2000","unstructured":"Puerto, J., & Fernandez, F. R. (2000). Geometrical properties of the symmetrical single facility location problem. Journal of Nonlinear Convex Analysis, 1, 321\u2013342.","journal-title":"Journal of Nonlinear Convex Analysis"},{"key":"344_CR88","unstructured":"Rayco, M. B. (1996). Algorithmic approaches to demand point aggregation for location models. Ph. D. Dissertation, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL."},{"key":"344_CR89","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0966-8349(97)00006-5","volume":"4","author":"M. B. Rayco","year":"1997","unstructured":"Rayco, M. B., Francis, R. L., & Lowe, T. J. (1997). Error-bound driven demand point aggregation for the rectilinear distance p-center model. Location Science, 4, 213\u2013235.","journal-title":"Location Science"},{"key":"344_CR90","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/S0305-0548(99)00019-2","volume":"26","author":"M. B. Rayco","year":"1999","unstructured":"Rayco, M. B., Francis, R. L., & Tamir, A. (1999). A p-center grid-positioning aggregation procedure. Computers and Operations Research, 26, 1113\u20131124.","journal-title":"Computers and Operations Research"},{"key":"344_CR91","volume-title":"Modern heuristic techniques for combinatorial problems","author":"C. Reeves","year":"1993","unstructured":"Reeves, C. (1993). Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific Press."},{"key":"344_CR92","volume-title":"Metaheuristics: computer decision-making","year":"2004","unstructured":"Resende, M. G. C., & de Sousa, J. P. (Eds.). (2004). Metaheuristics: computer decision-making. Boston: Kluwer Academic."},{"key":"344_CR93","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R. T. Rockafellar","year":"1970","unstructured":"Rockafellar, R. T. (1970). Convex analysis. Princeton: Princeton University Press."},{"key":"344_CR94","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1068\/a150781","volume":"15","author":"A. Rodriguez-Bachiller","year":"1983","unstructured":"Rodriguez-Bachiller, A. (1983). Errors in the measurement of spatial distances between discrete regions. Environment and Planning A, 15, 781\u2013799.","journal-title":"Environment and Planning A"},{"key":"344_CR95","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s001860050003","volume":"51","author":"A. M. Rodriguez-Chia","year":"2000","unstructured":"Rodriguez-Chia, A. M., Nickel, S., Puerto, J., & Fernandez, F. R. (2000). A flexible approach to location problems. Mathematical Methods of Operations Research, 51, 69\u201389.","journal-title":"Mathematical Methods of Operations Research"},{"key":"344_CR96","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"D. F. Rogers","year":"1991","unstructured":"Rogers, D. F., Plante, R. D., Wong, R. T., & Evans, J. R. (1991). Aggregation and disaggregation techniques and methodology in optimization. Operations Research, 39, 553\u2013582.","journal-title":"Operations Research"},{"key":"344_CR97","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0377-2217(97)00110-0","volume":"102","author":"D. Romero-Morales","year":"1997","unstructured":"Romero-Morales, D., Carrizosa, E., & Conde, E. (1997). Semi-obnoxious location models: a global optimization approach. European Journal of Operational Research, 102, 295\u2013301.","journal-title":"European Journal of Operational Research"},{"key":"344_CR98","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1215\/S0012-7094-50-01721-2","volume":"17","author":"R. A. Rosenbaum","year":"1950","unstructured":"Rosenbaum, R. A. (1950). Sub-additive functions. Duke Mathematical Journal, 17, 227\u2013247.","journal-title":"Duke Mathematical Journal"},{"key":"344_CR99","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02097794","volume":"18","author":"G. Rushton","year":"1989","unstructured":"Rushton, G. (1989). Applications of location models. Annals of Operations Research, 18, 25\u201342.","journal-title":"Annals of Operations Research"},{"key":"344_CR100","first-page":"14","volume-title":"Urban transportation networks: equilibrium analysis with mathematical programming models","author":"Y. Sheffi","year":"1985","unstructured":"Sheffi, Y. (1985). Urban transportation networks: equilibrium analysis with mathematical programming models (pp. 14\u201316). Englewood Cliffs: Prentice\u2013Hall."},{"key":"344_CR101","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/opre.31.2.292","volume":"31","author":"D. R. Shier","year":"1983","unstructured":"Shier, D. R., & Dearing, P. M. (1983). Optimal locations for a class of nonlinear, single-facility location problems on a network. Operations Research, 31, 292\u2013303.","journal-title":"Operations Research"},{"key":"344_CR102","doi-asserted-by":"crossref","unstructured":"Varadarajan, K. R. (1998). A divide and conquer algorithm for min-cost perfect matching in the plane. In Proceedings 38-th annual IEEE symposium on foundations of computer sciences, pp. 320\u2013331.","DOI":"10.1109\/SFCS.1998.743466"},{"key":"344_CR103","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1111\/j.1538-4632.1980.tb00023.x","volume":"12","author":"M. J. Webber","year":"1980","unstructured":"Webber, M. J. (1980). A theoretical analysis of aggregation in spatial interaction models. Geographical Analysis, 12, 129\u2013141.","journal-title":"Geographical Analysis"},{"key":"344_CR104","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0606017","volume":"6","author":"E. Zemel","year":"1985","unstructured":"Zemel, E. (1985). Probabilistic analysis of geometric location problems. SIAM J. Algebraic and Discrete Methods, 6, 189\u2013200.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"344_CR105","unstructured":"Zhao, P. (1996). Analysis of aggregation effects in location problems. Ph. D. Dissertation, Dept. of Industrial Engineering, University at Buffalo (SUNY), Buffalo, NY."},{"key":"344_CR106","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0377-2217(98)00010-1","volume":"113","author":"P. Zhao","year":"1999","unstructured":"Zhao, P., & Batta, R. (1999). Analysis of centroid aggregation for the Euclidean distance p-median problem. European Journal of Operational Research, 113, 147\u2013168.","journal-title":"European Journal of Operational Research"},{"key":"344_CR107","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/1097-0037(200012)36:4<233::AID-NET4>3.0.CO;2-I","volume":"36","author":"P. Zhao","year":"2000","unstructured":"Zhao, P., & Batta, R. (2000). An aggregation approach to solving the network p-median problem with link demands. Networks, 36, 233\u2013241.","journal-title":"Networks"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0344-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0344-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0344-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T11:30:29Z","timestamp":1631014229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0344-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,8]]},"references-count":107,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["344"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0344-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,8]]}}}