{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:44:05Z","timestamp":1648925045933},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T00:00:00Z","timestamp":1466985600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10479-016-2255-8","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T01:33:39Z","timestamp":1466991219000},"page":"613-638","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Primal and dual bounds for the vertex p-median problem with balance constraints"],"prefix":"10.1007","volume":"258","author":[{"given":"Juan A.","family":"D\u00edaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dolores E.","family":"Luna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,27]]},"reference":[{"key":"2255_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, S., & Osman, I. H. (2004). Density based problem space search for the capacitated clustering \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. Annals of Operations Research, 131, 21\u201343.","DOI":"10.1023\/B:ANOR.0000039511.61195.21"},{"key":"2255_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1023347000978","volume":"121","author":"PK Bergey","year":"2003","unstructured":"Bergey, P. K., Ragsdale, C. T., & Hoskote, M. (2003). A simulated annealing genetic algorithm for the electrical power districting problem. Annals of Operations Research, 121, 33\u201355.","journal-title":"Annals of Operations Research"},{"key":"2255_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10852-007-9074-5","volume":"7","author":"M Boccia","year":"2008","unstructured":"Boccia, M., Sforza, A., Sterle, C., & Vasilyev, I. (2008). A cut and branch approach for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem based on Fenchel cutting planes. Journal of Mathematical Modelling and Algorithms, 7, 43\u201358.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"2255_CR4","doi-asserted-by":"crossref","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, 12\u201326.","journal-title":"European Journal of Operational Research"},{"key":"2255_CR5","first-page":"319","volume":"1","author":"A Ceselli","year":"2003","unstructured":"Ceselli, A. (2003). Two exact algorithms for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. 4OR: Quarterly Journal of Operations Research, 1, 319\u2013340.","journal-title":"4OR: Quarterly Journal of Operations Research"},{"key":"2255_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20059","volume":"45","author":"A Ceselli","year":"2005","unstructured":"Ceselli, A., & Righini, G. (2005). A branch and price algorithm for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. Networks, 45, 125\u2013142.","journal-title":"Networks"},{"key":"2255_CR7","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0305-0548(01)00056-9","volume":"29","author":"SJ D\u2019amico","year":"2002","unstructured":"D\u2019amico, S. J., Wang, S., Batta, R., & Rump, C. M. (2002). A simulated annealing approach to police district design. Computers and Operations Research, 29, 667\u2013684.","journal-title":"Computers and Operations Research"},{"key":"2255_CR8","doi-asserted-by":"crossref","unstructured":"D\u00edaz, J. A., & Fern\u00e1ndez, E. (2006). Hybrid scatter search and path relinking for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. European Journal of Operational Research, 169, 570\u2013585.","DOI":"10.1016\/j.ejor.2004.08.016"},{"key":"2255_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.cor.2013.11.006","volume":"44","author":"MG Elizondo-Amaya","year":"2014","unstructured":"Elizondo-Amaya, M. G., R\u00edos-Mercado, R. Z., & D\u00edaz, J. A. (2014). A dual bounding scheme for a territory design problem. Computers and Operations Research, 44, 193\u2013205.","journal-title":"Computers and Operations Research"},{"key":"2255_CR10","doi-asserted-by":"crossref","unstructured":"Fleszar, K., & Hindi, K. S. (2008). An effective VNS for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. European Journal of Operational Research, 191, 612\u2013622.","DOI":"10.1016\/j.ejor.2006.12.055"},{"key":"2255_CR11","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1016\/S0305-0548(96)00029-9","volume":"23","author":"M Hojati","year":"1996","unstructured":"Hojati, M. (1996). Optimal political districting. Computers and Operations Research, 23, 1147\u20131161.","journal-title":"Computers and Operations Research"},{"key":"2255_CR12","doi-asserted-by":"crossref","unstructured":"Kalcsics, J., Nickel, S., & Schr\u00f6der, M. (2005). Towards a unified territory design approach\u2014applications, algorithms and GIS integration. TOP, 13, 1\u201356.","DOI":"10.1007\/BF02578982"},{"key":"2255_CR13","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/S0305-0548(03)00039-X","volume":"31","author":"LAN Lorena","year":"2004","unstructured":"Lorena, L. A. N., & Senne, E. L. F. (2004). A column generation approach for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. Computers and Operations Research, 31, 863\u2013876.","journal-title":"Computers and Operations Research"},{"key":"2255_CR14","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107, N., Brimberg, J., Hansen, P., & Moreno-P\u00e9rez, J. A. (2007). The \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179, 927\u2013939.","DOI":"10.1016\/j.ejor.2005.05.034"},{"key":"2255_CR15","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0377-2217(01)00184-9","volume":"139","author":"L Muyldermans","year":"2002","unstructured":"Muyldermans, L., Cattrysse, D., Van Oudheusden, D., & Lotan, T. (2002). Districting for salt spreading operations. European Journal of Operational Research, 139, 521\u2013532.","journal-title":"European Journal of Operational Research"},{"key":"2255_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.dam.2014.05.017","volume":"196","author":"D Porumbel","year":"2015","unstructured":"Porumbel, D., & Goncalves, G. (2015). Using dual feasible functions to construct fast lower bounds for routing and location problems. Discrete Applied Mathematics, 196, 83\u201399.","journal-title":"Discrete Applied Mathematics"},{"key":"2255_CR17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese, J. (2006). Solution methods the \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem: An annotated bibliography. Networks, 48, 125\u2013142.","journal-title":"Networks"},{"key":"2255_CR18","doi-asserted-by":"crossref","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, 1409\u20131426.","journal-title":"European Journal of Operational Research"},{"key":"2255_CR19","doi-asserted-by":"crossref","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, 271\u2013299.","journal-title":"Annals of Operations Research"},{"key":"2255_CR20","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.cor.2007.10.024","volume":"36","author":"RZ R\u00edos-Mercado","year":"2009","unstructured":"R\u00edos-Mercado, R. Z., & Fern\u00e1ndez, E. (2009). A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Computers and Operations Research, 36, 755\u2013776.","journal-title":"Computers and Operations Research"},{"key":"2255_CR21","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.omega.2012.08.002","volume":"41","author":"RZ R\u00edos-Mercado","year":"2013","unstructured":"R\u00edos-Mercado, R. Z., & L\u00f3pez-P\u00e9rez, J. F. (2013). Commercial territory design planning with realignment and disjoint assignment requirements. Omega, 41, 525\u2013535.","journal-title":"Omega"},{"key":"2255_CR22","doi-asserted-by":"crossref","unstructured":"Salazar-Aguilar, M. A., R\u00edos-Mercado, R. Z., & Cabrera-R\u00edos, M. (2011). New models for commercial territory design. Network and Spatial Economics, 11, 487\u2013507.","DOI":"10.1007\/s11067-010-9151-6"},{"key":"2255_CR23","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.ejor.2004.08.014","volume":"169","author":"S Scheuerer","year":"2006","unstructured":"Scheuerer, S., & Wendolsky, R. (2006). A scatter search heuristic for the capacitated clustering problem. European Journal of Operational Research, 169, 533\u2013547.","journal-title":"European Journal of Operational Research"},{"key":"2255_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10479-007-0181-5","volume":"154","author":"F Tavares-Pereira","year":"2007","unstructured":"Tavares-Pereira, F., Figueira, J. R., Mousseau, V., & Roy, B. (2007). Multiple criteria districting problems. Annals of Operations Research, 154, 69\u201392.","journal-title":"Annals of Operations Research"},{"key":"2255_CR25","doi-asserted-by":"crossref","first-page":"3922","DOI":"10.1016\/j.asoc.2013.04.009","volume":"13","author":"M Yaghini","year":"2013","unstructured":"Yaghini, M., Karimi, M., & Rahbar, M. (2013). A hybrid metaheuristic approach for the capacitated \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -median problem. Applied Soft Computing, 13, 3922\u20133930.","journal-title":"Applied Soft Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2255-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2255-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2255-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2255-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T12:38:34Z","timestamp":1510835914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2255-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,27]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2255"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2255-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,27]]}}}