{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T07:48:19Z","timestamp":1775807299532,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T00:00:00Z","timestamp":1514505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONICYT + PAI\/ Concurso nacional de apoyo al retorno de investigadores\/as desde el extranjero convocatoria 2014","award":["82140043"],"award-info":[{"award-number":["82140043"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10479-017-2742-6","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T14:58:45Z","timestamp":1514559525000},"page":"87-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution"],"prefix":"10.1007","volume":"286","author":[{"given":"Sebasti\u00e1n","family":"Moreno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilfredo","family":"Yushimito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,29]]},"reference":[{"key":"2742_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-818","volume-title":"Facets of combinatorial optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., & Wunderling, R. (2013). Mixed integer programming: Analyzing 12 years of progress. In M. J\u00fcnger & G. Reinelt (Eds.), Facets of combinatorial optimization (pp. 449\u2013482). Heidelberg: Springer. \nhttps:\/\/doi.org\/10.1007\/978-3-642-38189-818\n\n."},{"key":"2742_CR2","first-page":"81","volume":"23","author":"M Altman","year":"1997","unstructured":"Altman, M. (1997). Is automation the answer: The computational complexity of automated redistricting. Rutgers Computer and Law Technology Journal, 23, 81\u2013141.","journal-title":"Rutgers Computer and Law Technology Journal"},{"issue":"1","key":"2742_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cor.2013.08.002","volume":"41","author":"L Assis","year":"2014","unstructured":"Assis, L., Franca, P., & Usberti, F. (2014). A redistricting problem applied to meter reading in power distribution networks. Computers and Operations Research, 41(1), 65\u201375. \nhttps:\/\/doi.org\/10.1016\/j.cor.2013.08.002\n\n.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"2742_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s00500-004-0413-4","volume":"9","author":"F Ba\u00e7ao","year":"2005","unstructured":"Ba\u00e7ao, F., Lobo, V., & Painho, M. (2005). Applying genetic algorithms to zone design. Soft Computing, 9(5), 341\u2013348. \nhttps:\/\/doi.org\/10.1007\/s00500-004-0413-4\n\n.","journal-title":"Soft Computing"},{"issue":"5","key":"2742_CR5","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.trb.2008.10.003","volume":"43","author":"J Bard","year":"2009","unstructured":"Bard, J., & Jarrah, A. (2009). Large-scale constrained clustering for rationalizing pickup and delivery operations. Transportation Research Part B: Methodological, 43(5), 542\u2013561. \nhttps:\/\/doi.org\/10.1016\/j.trb.2008.10.003\n\n.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"2742_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., & Vance, P. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329. \nhttps:\/\/doi.org\/10.1287\/opre.46.3.316\n\n.","journal-title":"Operations Research"},{"key":"2742_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J., & Hammersley, J. (1959). The shortest path through many points. Mathematical Proceedings of the Cambridge Philosophical Society, 55, 299\u2013327. \nhttps:\/\/doi.org\/10.1017\/S0305004100034095\n\n.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"2742_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0377-2217(91)90072-4","volume":"53","author":"L Bodin","year":"1991","unstructured":"Bodin, L., & Levy, L. (1991). The arc partitioning problem. European Journal of Operational Research, 53, 393\u2013401. \nhttps:\/\/doi.org\/10.1016\/0377-2217(91)90072-4\n\n.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2742_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/inte.2013.0685","volume":"43","author":"F Bonomo","year":"2013","unstructured":"Bonomo, F., Delle, D., Dur\u00e1n, G., & Marenco, J. (2013). Automatic dwelling segmentation of the Buenos Aires Province for the 2010 Argentinian census. Interfaces, 43(4), 373\u2013384. \nhttps:\/\/doi.org\/10.1287\/inte.2013.0685\n\n.","journal-title":"Interfaces"},{"issue":"1","key":"2742_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0377-2217(01)00380-0","volume":"144","author":"B Bozkaya","year":"2003","unstructured":"Bozkaya, B., Erkut, E., & Laporte, G. (2003). A tabu search heuristic and adaptive memory procedure for political districting. European Journal of Operational Research, 144(1), 12\u201326. \nhttps:\/\/doi.org\/10.1016\/S0377-2217(01)00380-0\n\n.","journal-title":"European Journal of Operational Research"},{"key":"2742_CR11","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1287\/ijoc.2014.0600","volume":"26","author":"A Butsch","year":"2014","unstructured":"Butsch, A., Kalcsics, J., & Laporte, G. (2014). Districting for Arc routing. INFORMS Journal on Computing, 26, 809\u2013824. \nhttps:\/\/doi.org\/10.1287\/ijoc.2014.0600\n\n.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2742_CR12","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2015.05.023","volume":"246","author":"M Camacho-Collados","year":"2015","unstructured":"Camacho-Collados, M., Liberatore, F., & Angulo, J. (2015). A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector. European Journal of Operational Research, 246(2), 674\u2013684. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2015.05.023\n\n.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2742_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., & Fischetti, M. (2000). Algorithms for the set covering problem. Annals of Operations Research, 98(1), 353\u2013371. \nhttps:\/\/doi.org\/10.1023\/A:1019225027893\n\n.","journal-title":"Annals of Operations Research"},{"key":"2742_CR14","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1057\/palgrave.jors.2601729","volume":"55","author":"F Caro","year":"2004","unstructured":"Caro, F., Shirabe, T., Guignard, M., & Weintraub, A. (2004). School redistricting: Embedding GIS tools with integer programming. Journal of the Operational Research Society, 55, 836\u2013849. \nhttps:\/\/doi.org\/10.1057\/palgrave.jors.2601729\n\n.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"2742_CR15","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.ejor.2014.12.020","volume":"243","author":"B \u00c7avdar","year":"2015","unstructured":"\u00c7avdar, B., & Sokol, J. (2015). A distribution-free tsp tour length estimation model for random graphs. European Journal of Operational Research, 243(2), 588\u2013598. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2014.12.020\n\n.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2742_CR16","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.cor.2008.09.011","volume":"37","author":"A Chaves","year":"2010","unstructured":"Chaves, A., & Nogueira, L. (2010). Clustering search algorithm for the capacitated centered clustering problem. Computers and Operation Research, 37(3), 552\u2013558. \nhttps:\/\/doi.org\/10.1016\/j.cor.2008.09.011\n\n.","journal-title":"Computers and Operation Research"},{"issue":"5","key":"2742_CR17","doi-asserted-by":"publisher","first-page":"5013","DOI":"10.1016\/j.eswa.2010.09.149","volume":"38","author":"A Chaves","year":"2011","unstructured":"Chaves, A., & Nogueira, L. (2011). Hybrid evolutionary algorithm for the capacitated centered clustering problem. Expert Systems with Applications, 38(5), 5013\u20135018. \nhttps:\/\/doi.org\/10.1016\/j.eswa.2010.09.149\n\n.","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"2742_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/0305-0548(92)90002-M","volume":"19","author":"T Chien","year":"1992","unstructured":"Chien, T. (1992). Operational estimators for the length of a traveling salesman tour. Computers and Operations Research, 19(6), 469\u2013478. \nhttps:\/\/doi.org\/10.1016\/0305-0548(92)90002-M\n\n.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"2742_CR19","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/trsc.18.4.331","volume":"18","author":"CF Daganzo","year":"1984","unstructured":"Daganzo, C. F. (1984). The distance traveled to visit n points with a maximum of c stops per vehicle: An analytic model and an application. Transportation Science, 18(4), 331\u2013350. \nhttps:\/\/doi.org\/10.1287\/trsc.18.4.331\n\n.","journal-title":"Transportation Science"},{"key":"2742_CR20","doi-asserted-by":"publisher","unstructured":"Davidson I (2005) Clustering with constraints: Feasibility issues and the K-Means algorithm. In: Proceedings of the Fifth SIAM International Conference (pp. 138\u2013149). \nhttps:\/\/doi.org\/10.1137\/1.9781611972757.13","DOI":"10.1137\/1.9781611972757.13"},{"issue":"3","key":"2742_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1177\/0160017607301605","volume":"30","author":"J Duque","year":"2007","unstructured":"Duque, J., Ramos, R., & Suri\u00f1ach, J. (2007). Supervised regionalization methods: A aurvey. International Regional Science Review, 30(3), 195\u2013220. \nhttps:\/\/doi.org\/10.1177\/0160017607301605\n\n.","journal-title":"International Regional Science Review"},{"issue":"3","key":"2742_CR22","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/j.1467-9787.2011.00743.x","volume":"52","author":"J Duque","year":"2012","unstructured":"Duque, J., Anselin, L., & Rey, S. (2012). The max-p-regions problem. Journal of Regional Science, 52(3), 397\u2013419. \nhttps:\/\/doi.org\/10.1111\/j.1467-9787.2011.00743.x\n\n.","journal-title":"Journal of Regional Science"},{"issue":"4","key":"2742_CR23","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.tre.2009.04.005","volume":"46","author":"MA Figliozzi","year":"2010","unstructured":"Figliozzi, M. A. (2010). The impacts of congestion on commercial vehicle tour characteristics and costs. Transportation Research Part E: Logistics and Transportation Review, 46(4), 496\u2013506. \nhttps:\/\/doi.org\/10.1016\/j.tre.2009.04.005\n\n.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"6","key":"2742_CR24","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/0305-0548(88)90048-2","volume":"15","author":"B Fleischmann","year":"1988","unstructured":"Fleischmann, B., & Paraschis, J. (1988). Solving a large scale districting problem: A case report. Computers and Operations Research, 15(6), 521\u2013533. \nhttps:\/\/doi.org\/10.1016\/0305-0548(88)90048-2\n\n.","journal-title":"Computers and Operations Research"},{"key":"2742_CR25","doi-asserted-by":"publisher","DOI":"10.1111\/j.1751-5823.2009.00095_18.x","volume-title":"The elements of statistical learning: Data mining, inference, and prediction","author":"J Friedman","year":"2009","unstructured":"Friedman, J., Tibshirani, R., & Hastie, T. (2009). The elements of statistical learning: Data mining, inference, and prediction. Berlin: Springer. \nhttps:\/\/doi.org\/10.1111\/j.1751-5823.2009.00095_18.x\n\n."},{"issue":"1","key":"2742_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2004.07.001","volume":"33","author":"L Galvao","year":"2006","unstructured":"Galvao, L., Novaes, A., Souza De Cursi, J., & Souza, J. (2006). A multiplicatively-weighted voronoi diagram approach to logistics districting. Computers and Operations Research, 33(1), 93\u2013114. \nhttps:\/\/doi.org\/10.1016\/j.cor.2004.07.001\n\n.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2742_CR27","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1111\/itor.12219","volume":"23","author":"G Garc\u00eda-Ayala","year":"2016","unstructured":"Garc\u00eda-Ayala, G., Gonz\u00e1lez-Velarde, J., R\u00edos-Mercado, R., & Fern\u00e1ndez, E. (2016). A novel model for arc territory design: Promoting Eulerian districts. International Transactions in Operational Research, 23(3), 433\u2013458. \nhttps:\/\/doi.org\/10.1111\/itor.12219\n\n.","journal-title":"International Transactions in Operational Research"},{"issue":"8","key":"2742_CR28","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"R Garfinkel","year":"1970","unstructured":"Garfinkel, R., & Nemhauser, G. (1970). Optimal political districting by implicit enumeration techniques. Management Science, 16(8), 495\u2013508. \nhttps:\/\/doi.org\/10.1287\/mnsc.16.8.B495\n\n.","journal-title":"Management Science"},{"issue":"2","key":"2742_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.disopt.2008.10.004","volume":"6","author":"P Hansen","year":"2009","unstructured":"Hansen, P., Labb, M., & Schindl, D. (2009). Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discrete Optimization, 6(2), 135\u2013147. \nhttps:\/\/doi.org\/10.1016\/j.disopt.2008.10.004\n\n.","journal-title":"Discrete Optimization"},{"issue":"4\u2013part\u2014-ii","key":"2742_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1287\/mnsc.18.4.P41","volume":"18","author":"S Hess","year":"1971","unstructured":"Hess, S., & Samuels, S. (1971). Experiences with a sales districting model: Criteria and implementation. Management Science, 18(4\u2013part\u2014-ii), 41\u201354. \nhttps:\/\/doi.org\/10.1287\/mnsc.18.4.P41\n\n.","journal-title":"Management Science"},{"key":"2742_CR31","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1287\/opre.13.6.998","volume":"13","author":"S Hess","year":"1965","unstructured":"Hess, S., Weaver, J., Siegfeldt, H., Whelan, J., & Zitlau, P. (1965). Nonpartisan political redistricting by computer. Operations Research, 13, 998\u20131008. \nhttps:\/\/doi.org\/10.1287\/opre.13.6.998\n\n.","journal-title":"Operations Research"},{"key":"2742_CR32","doi-asserted-by":"publisher","first-page":"3482","DOI":"10.1007\/978-0-387-74759-0599","volume-title":"Encyclopedia of optimization","author":"K Hoffman","year":"2009","unstructured":"Hoffman, K., & Padberg, M. (2009). Set covering, packing and partitioning problems. In C. A. Floudas & P. M. Pardalos (Eds.), Encyclopedia of optimization (pp. 3482\u20133486). Boston: Springer. \nhttps:\/\/doi.org\/10.1007\/978-0-387-74759-0599\n\n."},{"key":"2742_CR33","doi-asserted-by":"publisher","first-page":"68","DOI":"10.3141\/2238-09","volume":"2238","author":"J Holgu\u00edn-Veras","year":"2011","unstructured":"Holgu\u00edn-Veras, J., Ozbay, K., Kornhauser, A., Brom, M., Iyer, S., Yushimito, W., et al. (2011). Overall impacts of off-hour delivery programs in New York city metropolitan area. Transportation Research Record: Journal of the Transportation Research Board, 2238, 68\u201376. \nhttps:\/\/doi.org\/10.3141\/2238-09\n\n.","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"issue":"3 PART 1","key":"2742_CR34","doi-asserted-by":"publisher","first-page":"5248","DOI":"10.1016\/j.eswa.2008.06.074","volume":"36","author":"Z Hu","year":"2009","unstructured":"Hu, Z., Ding, Y., & Shao, Q. (2009). Immune co-evolutionary algorithm based partition balancing optimization for tobacco distribution system. Expert Systems with Applications, 36(3 PART 1), 5248\u20135255. \nhttps:\/\/doi.org\/10.1016\/j.eswa.2008.06.074\n\n.","journal-title":"Expert Systems with Applications"},{"issue":"12","key":"2742_CR35","doi-asserted-by":"publisher","first-page":"3102","DOI":"10.1016\/j.cor.2012.03.014","volume":"39","author":"A Jarrah","year":"2012","unstructured":"Jarrah, A., & Bard, J. (2012). Large-scale pickup and delivery work area design. Computers and Operations Research, 39(12), 3102\u20133118. \nhttps:\/\/doi.org\/10.1016\/j.cor.2012.03.014\n\n.","journal-title":"Computers and Operations Research"},{"key":"2742_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13111-5","volume-title":"Location Science","year":"2015","unstructured":"Kalcsics, J. (2015). Districting problems. In G. Laporte & S. Nickel (Eds.), Location science. Berlin: Springer. \nhttps:\/\/doi.org\/10.1007\/978-3-319-13111-5\n\n."},{"issue":"1","key":"2742_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02578982","volume":"13","author":"J Kalcsics","year":"2005","unstructured":"Kalcsics, J., Nickel, S., & Schr\u00f6der, M. (2005). Towards a unified territorial design approach-applications, algorithms and GIS Integration. Top, 13(1), 1.","journal-title":"Top"},{"issue":"10","key":"2742_CR38","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/0305-0548(94)00093-N","volume":"22","author":"O Kwon","year":"1995","unstructured":"Kwon, O., Golden, B., & Wasil, E. (1995). Estimating the length of the optimal tsp tour: An empirical study using regression and neural networks. Computers and Operations Research, 22(10), 1039\u20131046. \nhttps:\/\/doi.org\/10.1016\/0305-0548(94)00093-N\n\n.","journal-title":"Computers and Operations Research"},{"issue":"3 PART B","key":"2742_CR39","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0191-2615(95)00035-6","volume":"30","author":"A Langevin","year":"1996","unstructured":"Langevin, A., Mbaraga, P., & Campbell, J. (1996). Continuous approximation models in freight distribution: An overview. Transportation Research Part B: Methodological, 30(3 PART B), 163\u2013188. \nhttps:\/\/doi.org\/10.1016\/0191-2615(95)00035-6\n\n.","journal-title":"Transportation Research Part B: Methodological"},{"key":"2742_CR40","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2014.11.008","volume":"56","author":"H Lei","year":"2015","unstructured":"Lei, H., Laporte, G., Liu, Y., & Zhang, T. (2015). Dynamic design of sales territories. Computers and Operations Research, 56, 84\u201392. \nhttps:\/\/doi.org\/10.1016\/j.cor.2014.11.008\n\n.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2742_CR41","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1111\/gean.12038","volume":"46","author":"W Li","year":"2014","unstructured":"Li, W., Church, R., & Goodchild, M. (2014). The p-compact-regions problem. Geographical Analysis, 46(3), 250\u2013273. \nhttps:\/\/doi.org\/10.1111\/gean.12038\n\n.","journal-title":"Geographical Analysis"},{"issue":"2","key":"2742_CR42","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"2006","unstructured":"Lloyd, S. (2006). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129\u2013137. \nhttps:\/\/doi.org\/10.1109\/TIT.1982.1056489\n\n.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"2742_CR43","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1287\/mnsc.44.8.1100","volume":"44","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Johnson, E., & Nemhauser, G. (1998). An optimization based heuristic for political districting. Management Science, 44(8), 1100\u20131114. \nhttps:\/\/doi.org\/10.1287\/mnsc.44.8.1100\n\n.","journal-title":"Management Science"},{"issue":"6","key":"2742_CR44","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/j.cor.2004.11.011","volume":"33","author":"M Negreiros","year":"2006","unstructured":"Negreiros, M., & Palhano, A. (2006). The capacitated centred clustering problem. Computers and Operations Research, 33(6), 1639\u20131663. \nhttps:\/\/doi.org\/10.1016\/j.cor.2004.11.011\n\n.","journal-title":"Computers and Operations Research"},{"key":"2742_CR45","unstructured":"New York City Department of Transportation (2016) New york city mobility report. Technical report, Washington, DC, \nhttp:\/\/www.nyc.gov\/html\/dot\/downloads\/pdf\/mobility-report-2016-print.pdf"},{"issue":"8","key":"2742_CR46","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/TPAMI.2006.168","volume":"28","author":"R Nock","year":"2006","unstructured":"Nock, R., & Nielsen, F. (2006). On weighting clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(8), 1223\u20131235. \nhttps:\/\/doi.org\/10.1109\/TPAMI.2006.168\n\n.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"2742_CR47","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0377-2217(98)00344-0","volume":"119","author":"A Novaes","year":"1999","unstructured":"Novaes, A., & Graciolli, O. (1999). Designing multi-vehicle delivery tours in a grid-cell format. European Journal of Operational Research, 119(3), 613\u2013634. \nhttps:\/\/doi.org\/10.1016\/S0377-2217(98)00344-0\n\n.","journal-title":"European Journal of Operational Research"},{"key":"2742_CR48","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/S0305-0548(99)00063-5","volume":"27","author":"A Novaes","year":"2000","unstructured":"Novaes, A., de Cursi, J. E., & Graciolli, O. (2000). A continuous approach to the design of physical distribution systems. Computers and Operations Research, 27, 877\u2013893. \nhttps:\/\/doi.org\/10.1016\/S0305-0548(99)00063-5\n\n.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2742_CR49","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(89)90217-8","volume":"43","author":"H Ong","year":"1989","unstructured":"Ong, H., & Huang, H. (1989). Asymptotic expected performance of some tsp heuristics: An empirical evaluation. European Journal of Operational Research, 43(2), 231\u2013238. \nhttps:\/\/doi.org\/10.1016\/0377-2217(89)90217-8\n\n.","journal-title":"European Journal of Operational Research"},{"key":"2742_CR50","doi-asserted-by":"publisher","unstructured":"O\u2019Rourke, J. (1998). Computational Geometry in C (2nd ed.). New York: Cambridge University Press. \nhttps:\/\/doi.org\/10.1017\/CBO9780511804120\n\n.","DOI":"10.1017\/CBO9780511804120"},{"issue":"1","key":"2742_CR51","doi-asserted-by":"publisher","first-page":"89","DOI":"10.2307\/25769285","volume":"40","author":"Y Ouyang","year":"2006","unstructured":"Ouyang, Y., & Daganzo, C. (2006). Discretization and validation of the continuum approximation scheme for terminal system design. Transportation Science, 40(1), 89\u201398. \nhttps:\/\/doi.org\/10.2307\/25769285\n\n.","journal-title":"Transportation Science"},{"issue":"1","key":"2742_CR52","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-011-0876-5","volume":"207","author":"J Pereira","year":"2013","unstructured":"Pereira, J., & Averbakh, I. (2013). The robust set covering problem with interval data. Annals of Operations Research, 207(1), 217\u2013235. \nhttps:\/\/doi.org\/10.1007\/s10479-011-0876-5\n\n.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2742_CR53","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1016\/j.ejor.2006.08.065","volume":"189","author":"F Ricca","year":"2008","unstructured":"Ricca, F., & Simeone, B. (2008). Local search algorithms for political districting. European Journal of Operational Research, 189(3), 1409\u20131426. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2006.08.065\n\n.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2742_CR54","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10479-012-1267-2","volume":"204","author":"F Ricca","year":"2013","unstructured":"Ricca, F., Scozzari, A., & Simeone, B. (2013). Political districting: From classical models to recent approaches. Annals of Operations Research, 204(1), 271\u2013299. \nhttps:\/\/doi.org\/10.1007\/s10479-012-1267-2\n\n.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2742_CR55","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cor.2007.10.024","volume":"36","author":"R R\u00edos-Mercado","year":"2009","unstructured":"R\u00edos-Mercado, R., & Fern\u00e1ndez, E. (2009). A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Computers and Operations Research, 36(3), 755\u2013776. \nhttps:\/\/doi.org\/10.1016\/j.cor.2007.10.024\n\n.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2742_CR56","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s11067-010-9151-6","volume":"11","author":"M Salazar-Aguilar","year":"2011","unstructured":"Salazar-Aguilar, M., R\u00edos-Mercado, R., & Cabrera-R\u00edos, M. (2011a). New models for commercial territory design. Networks and Spatial Economics, 11(3), 487\u2013507. \nhttps:\/\/doi.org\/10.1007\/s11067-010-9151-6\n\n.","journal-title":"Networks and Spatial Economics"},{"issue":"5","key":"2742_CR57","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1016\/j.trc.2010.09.011","volume":"19","author":"M Salazar-Aguilar","year":"2011","unstructured":"Salazar-Aguilar, M., R\u00edos-Mercado, R., & Gonz\u00e1lez-Velarde, J. (2011b). A bi-objective programming model for designing compact and balanced territories in commercial districting. Transportation Research Part C: Emerging Technologies, 19(5), 885\u2013895. \nhttps:\/\/doi.org\/10.1016\/j.trc.2010.09.011\n\n.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"2742_CR58","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10479-011-1045-6","volume":"199","author":"M Salazar-Aguilar","year":"2012","unstructured":"Salazar-Aguilar, M., R\u00edos-Mercado, R., Gonz\u00e1lez-Velarde, J., & Molina, J. (2012). Multiobjective scatter search for a commercial territory design problem. Annals of Operations Research, 199(1), 343\u2013360. \nhttps:\/\/doi.org\/10.1007\/s10479-011-1045-6\n\n.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2742_CR59","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10732-011-9160-8","volume":"19","author":"M Salazar-Aguilar","year":"2013","unstructured":"Salazar-Aguilar, M., R\u00edos-Mercado, R., & Gonz\u00e1lez-Velarde, J. (2013). Grasp strategies for a bi-objective commercial territory design problem. Journal of Heuristics, 19(2), 179\u2013200. \nhttps:\/\/doi.org\/10.1007\/s10732-011-9160-8\n\n.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"2742_CR60","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/moor.3.2.89","volume":"3","author":"D Stein","year":"1978","unstructured":"Stein, D. (1978). An asymptotic, probabilistic analysis of a routing problem. Mathematics of Operations Research, 3(2), 89\u2013101. \nhttps:\/\/doi.org\/10.1287\/moor.3.2.89\n\n.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"2742_CR61","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10479-007-0181-5","volume":"154","author":"F Tavares-Pereira","year":"2007","unstructured":"Tavares-Pereira, F., Figueira, J., Mousseau, V., & Roy, B. (2007). Multiple criteria districting problems: The public transportation network pricing system of the Paris region. Annals of Operations Research, 154(1), 69\u201392. \nhttps:\/\/doi.org\/10.1007\/s10479-007-0181-5\n\n.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2742_CR62","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.seps.2007.04.001","volume":"43","author":"F Tavares-Pereira","year":"2009","unstructured":"Tavares-Pereira, F., Figueira, J., Mousseau, V., & Roy, B. (2009). Comparing two territory partitions in districting problems: Indices and practical issues. Socio-Economic Planning Sciences, 43(1), 72\u201388. \nhttps:\/\/doi.org\/10.1016\/j.seps.2007.04.001\n\n.","journal-title":"Socio-Economic Planning Sciences"},{"key":"2742_CR63","volume-title":"Highway capacity manual","author":"Transportation Research Board","year":"2010","unstructured":"Transportation Research Board. (2010). Highway capacity manual (Vol. 5). Washington, DC: National Sciences Foundation."},{"key":"2742_CR64","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.apgeog.2014.03.001","volume":"50","author":"J Wang","year":"2014","unstructured":"Wang, J., Kwan, M., & Ma, L. (2014). Delimiting service area using adaptive crystal-growth Voronoi diagrams based on weighted planes: A case study in Haizhu District of Guangzhou in China. Applied Geography, 50, 108\u2013119. \nhttps:\/\/doi.org\/10.1016\/j.apgeog.2014.03.001\n\n.","journal-title":"Applied Geography"},{"issue":"3","key":"2742_CR65","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1287\/mksc.1050.0133","volume":"24","author":"A Zoltners","year":"2005","unstructured":"Zoltners, A., & Sinha, P. (2005). Sales territory design: Thirty years of modeling and implementation. Marketing Science, 24(3), 313\u2013331. \nhttps:\/\/doi.org\/10.1287\/mksc.1050.0133\n\n.","journal-title":"Marketing Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2742-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2742-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2742-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T18:15:01Z","timestamp":1581012901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2742-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,29]]},"references-count":65,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2742"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2742-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,29]]},"assertion":[{"value":"29 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}