{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:48:48Z","timestamp":1758635328315},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T00:00:00Z","timestamp":1310601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10288-011-0177-5","type":"journal-article","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T14:33:33Z","timestamp":1310567613000},"page":"223-254","source":"Crossref","is-referenced-by-count":28,"title":["Political districting: from classical models to recent approaches"],"prefix":"10.1007","volume":"9","author":[{"given":"Federica","family":"Ricca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Scozzari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,14]]},"reference":[{"key":"177_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187563","volume-title":"Local search in combinatorial optimization","author":"E Aarts","year":"2003","unstructured":"Aarts E, Lenstra JK (2003) Local search in combinatorial optimization. Princeton University Press, Princeton"},{"key":"177_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 Comput Law Technol J 23: 81\u2013142","journal-title":"Rutgers Comput Law Technol J"},{"key":"177_CR3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/net.20197","volume":"51","author":"N Apollonio","year":"2008","unstructured":"Apollonio N, Lari L, Puerto J, Ricca F, Simeone B (2008) Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. Networks 51: 78\u201389","journal-title":"Networks"},{"key":"177_CR4","unstructured":"Arcese F, Battista MG, Biasi O, Lucertini M, Simeone B (1992) Un modello multicriterio per la distrettizzazione elettorale: la metodologia C.A.P.I.R.E. A.D.E.N. (unpublished manuscript)"},{"key":"177_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","volume":"17","author":"F Aurenhammer","year":"1984","unstructured":"Aurenhammer F, Edelsbrunner H (1984) An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognit 17: 251\u2013257","journal-title":"Pattern Recognit"},{"key":"177_CR6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00500-004-0413-4","volume":"9","author":"F Ba\u00e7\u00e3o","year":"2005","unstructured":"Ba\u00e7\u00e3o F, Lobo V, Painho M (2005) Applying genetic algorithms to zone-design. Soft Comput 9: 341\u2013348","journal-title":"Soft Comput"},{"key":"177_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1111\/j.1749-6632.1973.tb41400.x","volume":"219","author":"LD Bodin","year":"1973","unstructured":"Bodin LD (1973) A district experiment with a clustering algorithm. Ann N Y Accad Sci 219: 209\u2013214","journal-title":"Ann N Y Accad Sci"},{"key":"177_CR8","first-page":"113","volume":"19","author":"G Laporte","year":"1981","unstructured":"Laporte G, Rousseau JM (1981) D\u00e9coupage electoral automatis\u00e9: application a l\u2019Ile de Montr\u00e9al. INFOR 19: 113\u2013124 (in French)","journal-title":"INFOR"},{"key":"177_CR9","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. Eur J Oper Res 144: 12\u201326","journal-title":"Eur J Oper Res"},{"key":"177_CR10","first-page":"163","volume":"8","author":"MH Browdy","year":"1990","unstructured":"Browdy MH (1990) Simulated annealing: an improved computer model for political redistricting. Yale Law Policy Rev 8: 163\u2013179","journal-title":"Yale Law Policy Rev"},{"key":"177_CR11","unstructured":"Bussamra NM, Fran\u00e7a PM, Sosa NG (1996) Legislative districting by heuristic methods. Proc of the Annual Conference of the Italian Operations Research Society"},{"key":"177_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","volume":"14","author":"RC Carlson","year":"1966","unstructured":"Carlson RC, Nemhauser GL (1966) Scheduling to minimize interaction cost. Oper Res 14: 52\u201358","journal-title":"Oper Res"},{"key":"177_CR13","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.physa.2006.01.082","volume":"369","author":"C Chou","year":"2006","unstructured":"Chou C, Li SP (2006) Taming the gerrymander\u2014statistical physics approach to political districting problem. Phisica A 369: 799\u2013808","journal-title":"Phisica A"},{"key":"177_CR14","unstructured":"Cordone R (2001) A short note on graph tree partition problems with assignment or communication objective functions. Internal Report DEI 2001.7, Politecnico di Milano, 2001"},{"key":"177_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1177\/0160017607301605","volume":"30","author":"JC Duque","year":"2007","unstructured":"Duque JC, Ramos R, Suri\u00f1ach J (2007) Supervised regionalization methods: a survey. Intern Reg Sci Rev 30: 195\u2013220","journal-title":"Intern Reg Sci Rev"},{"key":"177_CR16","doi-asserted-by":"crossref","first-page":"2072","DOI":"10.1007\/3-540-45110-2_104","volume":"2724","author":"SL Forman","year":"2003","unstructured":"Forman SL, Yue Y (2003) Congressional districting using a TSP-based genetic algorithm. Lect Note Comput Sci 2724: 2072\u20132083","journal-title":"Lect Note Comput Sci"},{"key":"177_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1177\/000276426400800407","volume":"7","author":"E Forrest","year":"1964","unstructured":"Forrest E (1964) Apportionment by computer. Am Behav Sci 7: 23\u201335","journal-title":"Am Behav Sci"},{"key":"177_CR18","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"key":"177_CR19","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"RS Garfinkel","year":"1970","unstructured":"Garfinkel RS, Nemhauser GL (1970) Optimal political districting by implicit enumeration techniques. Manag Sci 16: 495\u2013508","journal-title":"Manag Sci"},{"key":"177_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0038-0121(96)00016-X","volume":"31","author":"JA George","year":"1997","unstructured":"George JA, Lamar BW, Wallace CA (1997) Political district determination using large-scale network optimization. Socioecon Plann Sci 31: 11\u201328","journal-title":"Socioecon Plann Sci"},{"key":"177_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Boston"},{"key":"177_CR22","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"177_CR23","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719819","volume-title":"Evaluation and optimization of electoral systems, SIAM Monographs on Discrete Mathematics and Applications","author":"P Grilli di Cortona","year":"1999","unstructured":"Grilli di Cortona P, Manzi C, Pennisi A, Ricca F, Simeone B (1999) Evaluation and optimization of electoral systems, SIAM Monographs on Discrete Mathematics and Applications. SIAM (Society for Industrial and Applied Mathematics), Philadelphia"},{"key":"177_CR24","volume-title":"Graph theory","author":"F Harary","year":"1994","unstructured":"Harary F (1994) Graph theory. Addison-Wesley, Reading"},{"key":"177_CR25","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.13.6.998","volume":"13","author":"SW Hess","year":"1965","unstructured":"Hess SW, Weaver JB, Siegfelatt HJ, Whelan JN, Zitlau PA (1965) Nonpartisan political redistricting by computer. Oper Res 13: 998\u20131006","journal-title":"Oper Res"},{"key":"177_CR26","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. Comput Oper Res 23: 1147\u20131161","journal-title":"Comput Oper Res"},{"key":"177_CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0962-6298(93)90031-2","volume":"12","author":"DL Horn","year":"1993","unstructured":"Horn DL, Hampton CR, Vandenberg AJ (1993) Practical application of district compactness. Polit Geogr 12: 103\u2013120","journal-title":"Polit Geogr"},{"key":"177_CR28","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.7.4.417","volume":"7","author":"TC Hu","year":"1995","unstructured":"Hu TC, Kahng AB, Tsao CWA (1995) Old bachelor acceptance: a new class of non-monotone threshold accepting methods. ORSA J Comput 7: 417\u2013425","journal-title":"ORSA J Comput"},{"key":"177_CR29","doi-asserted-by":"crossref","first-page":"200","DOI":"10.2307\/2109148","volume":"10","author":"HF Kaiser","year":"1967","unstructured":"Kaiser HF (1967) An objective method for establishing legislative districts. Midwest J Polit Sci 10: 200\u2013213","journal-title":"Midwest J Polit Sci"},{"key":"177_CR30","doi-asserted-by":"crossref","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":"177_CR31","unstructured":"Li Z, Wang R, Wang Y (2007) A quadratic programming model for political districting problem. In: Proceedings of the firsst international symposium on optimization and system biology (OSB). Bejing, China, August 8\u201310, 2007"},{"key":"177_CR32","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21: 498\u2013516","journal-title":"Oper Res"},{"key":"177_CR33","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1287\/mnsc.44.8.1100","volume":"44","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Manag Sci 44: 1100\u20131114","journal-title":"Manag Sci"},{"key":"177_CR34","unstructured":"Miller S (2007) The problem of redistricting: the use of centroidal Voronoi diagrams to build unbiased congressional districts. Master thesis, Withmann College, USA. http:\/\/www.whitman.edu\/mathematics\/SeniorProjectArchive\/2007\/millersl.pdf"},{"key":"177_CR35","unstructured":"Nemoto T, Hotta K (2003) Modelling and solution of the problem of optimal electoral districting. Commun OR Soc Jpn 48:300\u2013306. http:\/\/www.orsj.or.jp\/~archive\/pdf\/bul\/Vol.4804300.pdf (in Japanese)"},{"key":"177_CR36","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.2307\/2131686","volume":"52","author":"RG Niemi","year":"1990","unstructured":"Niemi RG, Grofman B, Carlucci C, Hofeller T (1990) Measuring compactness and the role of a compactness standard in a test for partisan and ratial gerrymandering. J Polit 52: 1155\u20131182","journal-title":"J Polit"},{"key":"177_CR37","doi-asserted-by":"crossref","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. Math Program 42: 159\u2013169","journal-title":"Math Program"},{"key":"177_CR38","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"IH Osman","year":"1996","unstructured":"Osman IH, Laporte G (1996) Metaheuristics: a bibliography. Ann Oper Res 63: 513\u2013628","journal-title":"Ann Oper Res"},{"key":"177_CR39","unstructured":"Ricca F, Scozzari A, Simeone B (2007) Weighted Voronoi region algorithms for political districting. In: Proceedings of the international seminars. Schloss Dagstuhl, 07311\/2007, Frontiers of electronic voting. http:\/\/kathrin.dagstuhl.de\/07311\/Materials\/"},{"key":"177_CR40","doi-asserted-by":"crossref","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. Math Comput Model 48: 1468\u20131477","journal-title":"Math Comput Model"},{"key":"177_CR41","unstructured":"Ricca F (1996) Algoritmi di ricerca locale per la distrettizzazione elettorale. Proc of the Annual Conference of the Italian Operations Research Society"},{"key":"177_CR42","first-page":"81","volume":"27","author":"F Ricca","year":"1997","unstructured":"Ricca F, Simeone B (1997) Political districting: traps, criteria, algorithms and trade-offs. Ric Oper 27: 81\u2013119","journal-title":"Ric Oper"},{"key":"177_CR43","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. Eur J Oper Res 189: 1409\u20131426","journal-title":"Eur J Oper Res"},{"key":"177_CR44","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni S (1974) Computationally related problems. Siam J Comput 3: 262\u2013279","journal-title":"Siam J Comput"},{"key":"177_CR45","unstructured":"Simeone B (1978) Optimal graph partitioning. Proc of the Annual Conference of the Italian Operations Research Society"},{"key":"177_CR46","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, Fig JR, Mousseau V, Roy B (2007) Multiple criteria districting problem. The public transportation network pricing system of the Paris region. Ann Oper Res 154: 69\u201392","journal-title":"Ann Oper Res"},{"key":"177_CR47","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/2145973","volume":"76","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) On the prevention of gerrymandering. Polit Sci Quart 76: 105\u2013110","journal-title":"Polit Sci Quart"},{"key":"177_CR48","doi-asserted-by":"crossref","first-page":"288","DOI":"10.2307\/794769","volume":"73","author":"JB Weaver","year":"1963","unstructured":"Weaver JB, Hess SW (1963) A procedure for nonpartisan districting: development of computer techniques. Yale Law J 73: 288\u2013308","journal-title":"Yale Law J"},{"key":"177_CR49","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","volume":"91","author":"T Yamada","year":"1996","unstructured":"Yamada T, Takahashi H, Kataoka S (1996) A heuristic algorithm for the mini-max spanning forest problem. Eur J Oper Res 91: 565\u2013572","journal-title":"Eur J Oper Res"},{"key":"177_CR50","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1080\/00207720802645246","volume":"40","author":"T Yamada","year":"2009","unstructured":"Yamada T (2009) A mini-max spanning forest approach to the political districting problem. Int J Syst Sci 40: 471\u2013477","journal-title":"Int J Syst Sci"},{"key":"177_CR51","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/439947","volume":"13","author":"HP Young","year":"1988","unstructured":"Young HP (1988) Measuring compactness of legislative districts. Legis Stud Quart 13: 105\u2013111","journal-title":"Legis Stud Quart"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0177-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-011-0177-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0177-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T23:32:25Z","timestamp":1560382345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-011-0177-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,14]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s10288-011-0177-5","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,14]]}}}