{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:40:01Z","timestamp":1775130001602,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T00:00:00Z","timestamp":1583193600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T00:00:00Z","timestamp":1583193600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["174010"],"award-info":[{"award-number":["174010"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10479-020-03559-y","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T10:03:06Z","timestamp":1583229786000},"page":"247-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A new integer linear programming formulation for the problem of political districting"],"prefix":"10.1007","volume":"288","author":[{"given":"Djordje","family":"Dugo\u0161ija","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Savi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoran","family":"Maksimovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,3]]},"reference":[{"key":"3559_CR1","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 Operations Research, 144, 12\u201326.","journal-title":"European Journal of Operations Research"},{"key":"3559_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1111\/j.1538-4632.2010.00810.x","volume":"43","author":"J Duque","year":"2011","unstructured":"Duque, J., Church, R., & Middleton, R. (2011). The p-regions problem. Geographical Analysis, 43, 104\u2013126.","journal-title":"Geographical Analysis"},{"key":"3559_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1177\/0160017607301605","volume":"30","author":"J Duque","year":"2007","unstructured":"Duque, J., Ramos, R., & Surinach, J. (2007). Supervised regionalization methods: A survey. Regional Science Review, 30, 195\u2013220.","journal-title":"Regional Science Review"},{"key":"3559_CR4","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, 495\u2013508.","journal-title":"Management Science"},{"key":"3559_CR5","unstructured":"Giannuli, A. (1993). Vademecum referendum: tutto quello che vorreste sapere sulle leggi elettorali. I libri dell\u2019Altritalia, Libera informazione editrice, http:\/\/books.google.rs\/books?id=noyAMwEACAAJ, (in Italian)"},{"key":"3559_CR6","doi-asserted-by":"crossref","unstructured":"Grilli di Cortona, P., Manzi, C., Pennisi, A., Ricca, F., & Simeone, B. (1999). Evaluation and optimization of electoral systems. In P. L. Hammer (Ed.), SIAM monographs in discrete mathematics. Philadelphia:SIAM.","DOI":"10.1137\/1.9780898719819"},{"key":"3559_CR7","volume-title":"Graph theory","author":"F Harrary","year":"1994","unstructured":"Harrary, F. (1994). Graph theory. New York: Addison-Wesley."},{"key":"3559_CR8","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., Siegfelatt, H., Whelan, J., & Zitlau, P. (1965). Nonpartisan political redistricting by computer. Operations Research, 13, 998\u20131006.","journal-title":"Operations Research"},{"key":"3559_CR9","doi-asserted-by":"publisher","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 & Operations Research, 23, 1147\u20131161.","journal-title":"Computers & Operations Research"},{"key":"3559_CR10","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\u2014Applications, algorithms and gis integration. TOP, 13, 1\u201374.","journal-title":"TOP"},{"key":"3559_CR11","unstructured":"Li, Z., Wang, R., & Wang, Y. (2007). A quadratic programming model for political districting problem. In Proceedings of the first international symposium on optimization and system biology\u2014OSB. Lecture Notes in Computer Science (Vol. 2664, pp. 144\u2013157). Springer."},{"key":"3559_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s11590-017-1156-3","volume":"12","author":"L Mallozzi","year":"2018","unstructured":"Mallozzi, L., & Puerto, J. (2018). The geometry of optimal partitions in location problems. Optimization Letters, 12, 203\u2013220.","journal-title":"Optimization Letters"},{"key":"3559_CR13","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, 1100\u20131114.","journal-title":"Management Science"},{"key":"3559_CR14","first-page":"300","volume":"48","author":"T Nemoto","year":"2003","unstructured":"Nemoto, T., & Hotta, K. (2003). Modelling and solution of the problem of optimal electoral districting. Communications of the OR Society of Japan, 48, 300\u2013306. (in Japanese).","journal-title":"Communications of the OR Society of Japan"},{"key":"3559_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01589400","volume":"42","author":"B Nygreen","year":"1988","unstructured":"Nygreen, B. (1988). European assembly constituencies for Wales. Comparing of methods for solving a political districting problem. Mathematical Programming, 42, 159\u2013169.","journal-title":"Mathematical Programming"},{"key":"3559_CR16","doi-asserted-by":"publisher","first-page":"1468","DOI":"10.1016\/j.mcm.2008.05.041","volume":"48","author":"F Ricca","year":"2008","unstructured":"Ricca, F., Scozzari, A., & Simeone, B. (2008). Weighted Voronoi Region Algorithms for Political Districting. Mathematical and Computer Modelling, 48, 1468\u20131477.","journal-title":"Mathematical and Computer Modelling"},{"key":"3559_CR17","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, 271\u2013299.","journal-title":"Annals of Operations Research"},{"key":"3559_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1111\/j.1538-4632.2005.00605.x","volume":"37","author":"T Shirabe","year":"2005","unstructured":"Shirabe, T. (2005). A model of contiguity for spatial unit allocation. Geographical Analysis, 37, 2\u201316.","journal-title":"Geographical Analysis"},{"key":"3559_CR19","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1068\/b34104","volume":"36","author":"T Shirabe","year":"2009","unstructured":"Shirabe, T. (2009). Districting modeling with exact contiguity constraints. Planning B: Planning and Design, 36, 1053\u20131066.","journal-title":"Planning B: Planning and Design"},{"key":"3559_CR20","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10479-013-1447-8","volume":"222","author":"X Tang","year":"2014","unstructured":"Tang, X., Soukhal, A., & T\u2019kindt, V. (2014). Preprocessing for a map sectorization problem by means of mathematical programming. Annals of Operations Research, 222, 551\u2013569.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03559-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-020-03559-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03559-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T00:11:16Z","timestamp":1614730276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-020-03559-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["3559"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03559-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,3]]},"assertion":[{"value":"3 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}