{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:45:42Z","timestamp":1778247942966,"version":"3.51.4"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"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":[[2013,4]]},"DOI":"10.1007\/s10479-012-1267-2","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T20:43:33Z","timestamp":1357677813000},"page":"271-299","source":"Crossref","is-referenced-by-count":116,"title":["Political Districting: from classical models to recent approaches"],"prefix":"10.1007","volume":"204","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":[[2013,1,9]]},"reference":[{"key":"1267_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, J. K. (2003). Local search in combinatorial optimization. Princeton: Princeton University Press."},{"key":"1267_CR2","first-page":"81","volume":"23","author":"M. Altman","year":"1997","unstructured":"Altman, M. (1997). Is automation the answer?\u2014The computational complexity of automated redistricting. Rutgers Computer & Technology Law Journal, 23, 81\u2013142.","journal-title":"Rutgers Computer & Technology Law Journal"},{"key":"1267_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":"1267_CR4","unstructured":"Arcese, F., Battista, M. G., 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":"1267_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 Recognition, 17, 251\u2013257.","journal-title":"Pattern Recognition"},{"key":"1267_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 Computing, 9, 341\u2013348.","journal-title":"Soft Computing"},{"key":"1267_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1111\/j.1749-6632.1973.tb41400.x","volume":"219","author":"L. D. Bodin","year":"1973","unstructured":"Bodin, L. D. (1973). A district experiment with a clustering algorithm. Annals of the New York Academy of Sciences, 219, 209\u2013214.","journal-title":"Annals of the New York Academy of Sciences"},{"key":"1267_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/03155986.1981.11731811","volume":"19","author":"J. M. Bourjolly","year":"1981","unstructured":"Bourjolly, J. M., Laporte, G., & Rousseau, J. M. (1981). D\u00e9coupage electoral automatis\u00e9: application a l\u2019Ile de Montr\u00e9al. INFOR. Information Systems and Operational Research, 19, 113\u2013124 (in French).","journal-title":"INFOR. Information Systems and Operational Research"},{"key":"1267_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. European Journal of Operational Research, 144, 12\u201326.","journal-title":"European Journal of Operational Research"},{"key":"1267_CR10","first-page":"163","volume":"8","author":"M. H. Browdy","year":"1990","unstructured":"Browdy, M. H. (1990). Simulated annealing: an improved computer model for political redistricting. Yale Law & Policy Review, 8, 163\u2013179.","journal-title":"Yale Law & Policy Review"},{"key":"1267_CR11","unstructured":"Bussamra, N. M., Fran\u00e7a, P. M., & Sosa, N. G. (1996). Legislative districting by heuristic methods. Atti Giornate AIRO Perugia."},{"key":"1267_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","volume":"14","author":"R. C. Carlson","year":"1966","unstructured":"Carlson, R. C., & Nemhauser, G. L. (1966). Scheduling to minimize interaction cost. Operations Research, 14, 52\u201358.","journal-title":"Operations Research"},{"key":"1267_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, S. P. (2006). Taming the gerrymander\u2014statistical physics approach to political districting problem. Physica. A, 369, 799\u2013808.","journal-title":"Physica. A"},{"key":"1267_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."},{"key":"1267_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1177\/0160017607301605","volume":"30","author":"J. C. Duque","year":"2007","unstructured":"Duque, J. C., Ramos, R., & Suri\u00f1ach, J. (2007). Supervised regionalization methods: a survey. International Regional Science Review, 30, 195\u2013220.","journal-title":"International Regional Science Review"},{"key":"1267_CR16","first-page":"2072","volume-title":"Lecture notes in computer science","author":"S. L. Forman","year":"2003","unstructured":"Forman, S. L., & Yue, Y. (2003). Congressional districting using a TSP-based genetic algorithm. In Lecture notes in computer science (Vol.\u00a02724, pp. 2072\u20132083)."},{"key":"1267_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. American Behavioral Scientist, 7, 23\u201335.","journal-title":"American Behavioral Scientist"},{"key":"1267_CR18","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. New York: Freeman."},{"key":"1267_CR19","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"R. S. Garfinkel","year":"1970","unstructured":"Garfinkel, R. S., & Nemhauser, G. L. (1970). Optimal political districting by implicit enumeration techniques. Management Science, 16, 495\u2013508.","journal-title":"Management Science"},{"key":"1267_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0038-0121(96)00016-X","volume":"31","author":"J. A. George","year":"1997","unstructured":"George, J. A., Lamar, B. W., & Wallace, C. A. (1997). Political district determination using large-scale network optimization. Socio-Economic Planning Sciences, 31, 11\u201328.","journal-title":"Socio-Economic Planning Sciences"},{"key":"1267_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. Boston: Kluwer."},{"key":"1267_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. Reading: Addison-Wesley."},{"key":"1267_CR23","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719819","volume-title":"Evaluation and optimization of electoral systems","author":"P. Cortona Grilli di","year":"1999","unstructured":"Grilli di Cortona, P., Manzi, C., Pennisi, A., Ricca, F., & Simeone, B. (1999). SIAM monographs on discrete mathematics and applications. Evaluation and optimization of electoral systems. Philadelphia: SIAM, Society for Industrial and Applied Mathematics."},{"key":"1267_CR24","volume-title":"Graph theory","author":"F. Harary","year":"1994","unstructured":"Harary, F. (1994). Graph theory. Reading: Addison-Wesley."},{"key":"1267_CR25","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.13.6.998","volume":"13","author":"S. W. Hess","year":"1965","unstructured":"Hess, S. W., Weaver, J. B., Siegfelatt, H. J., Whelan, J. N., & Zitlau, P. A. (1965). Nonpartisan political redistricting by computer. Operations Research, 13, 998\u20131006.","journal-title":"Operations Research"},{"key":"1267_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. Computers & Operations Research, 23, 1147\u20131161.","journal-title":"Computers & Operations Research"},{"key":"1267_CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0962-6298(93)90031-2","volume":"12","author":"D. L. Horn","year":"1993","unstructured":"Horn, D. L., Hampton, C. R., & Vandenberg, A. J. (1993). Practical application of district compactness. Political Geography, 12, 103\u2013120.","journal-title":"Political Geography"},{"key":"1267_CR28","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.7.4.417","volume":"7","author":"T. C. Hu","year":"1995","unstructured":"Hu, T. C., Kahng, A. B., & Tsao, C. W. A. (1995). Old bachelor acceptance: a new class of non-monotone threshold accepting methods. ORSA Journal on Computing, 7, 417\u2013425.","journal-title":"ORSA Journal on Computing"},{"key":"1267_CR29","doi-asserted-by":"crossref","first-page":"200","DOI":"10.2307\/2109148","volume":"10","author":"H. F. Kaiser","year":"1967","unstructured":"Kaiser, H. F. (1967). An objective method for establishing legislative districts. Midwest Journal of Political Science, 10, 200\u2013213.","journal-title":"Midwest Journal of Political Science"},{"key":"1267_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":"1267_CR31","volume-title":"Proceedings of the first international symposium on optimization and system biology (OSB)","author":"Z. Li","year":"2007","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 (OSB), Beijing, China, August 8\u201310, 2007."},{"key":"1267_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, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"1267_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, E. L., & Nemhauser, G. L. (1998). An optimization based heuristic for political districting. Management Science, 44, 1100\u20131114.","journal-title":"Management Science"},{"key":"1267_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":"1267_CR35","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. http:\/\/www.orsj.or.jp\/~archive\/pdf\/bul\/Vol.48_04_300.pdf (in Japanese).","journal-title":"Communications of the OR Society of Japan"},{"key":"1267_CR36","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.2307\/2131686","volume":"52","author":"R. G. Niemi","year":"1990","unstructured":"Niemi, R. G., Grofman, B., Carlucci, C., & Hofeller, T. (1990). Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. The Journal of Politics, 52, 1155\u20131182.","journal-title":"The Journal of Politics"},{"key":"1267_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. Mathematical Programming, 42, 159\u2013169.","journal-title":"Mathematical Programming"},{"key":"1267_CR38","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF02125421","volume":"63","author":"I. H. Osman","year":"1996","unstructured":"Osman, I. H., & Laporte, G. (1996). Metaheuristics: a bibliography. Annals of Operations Research, 63, 511\u2013623. Special issue: G. Laporte & I. H. Osman (Eds.), Metaheuristics in combinatorial optimization.","journal-title":"Annals of Operations Research"},{"key":"1267_CR39","unstructured":"Ricca, F. (1996). Algoritmi di ricerca locale per la distrettizzazione elettorale. Atti Giornate AIRO Perugia."},{"key":"1267_CR40","first-page":"81","volume":"27","author":"F. Ricca","year":"1997","unstructured":"Ricca, F., & Simeone, B. (1997). Political districting: traps, criteria, algorithms and trade-offs. Ricerca Operativa, 27, 81\u2013119.","journal-title":"Ricerca Operativa"},{"key":"1267_CR41","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":"1267_CR42","volume-title":"Proc. international seminars, Schloss Dagstuhl, 07311\/2007, frontiers of electronic voting","author":"F. Ricca","year":"2007","unstructured":"Ricca, F., Scozzari, A., & Simeone, B. (2007). Weighted Voronoi region algorithms for political districting. In Proc. international seminars, Schloss Dagstuhl, 07311\/2007, frontiers of electronic voting. http:\/\/kathrin.dagstuhl.de\/07311\/Materials\/ ."},{"key":"1267_CR43","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. Mathematical and Computer Modelling, 48, 1468\u20131477.","journal-title":"Mathematical and Computer Modelling"},{"key":"1267_CR44","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10288-011-0177-5","volume":"9","author":"F. Ricca","year":"2011","unstructured":"Ricca, F., Scozzari, A., & Simeone, B. (2011). Political Districting: from classical models to recent approaches. 4OR, 9, 223\u2013254.","journal-title":"4OR"},{"key":"1267_CR45","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 Journal on Computing, 3, 262\u2013279.","journal-title":"SIAM Journal on Computing"},{"key":"1267_CR46","unstructured":"Simeone, B. (1978). Optimal graph partitioning. Atti Giornate AIRO."},{"key":"1267_CR47","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 problem. The public transportation network pricing system of the Paris region. Annals of Operations Research, 154, 69\u201392.","journal-title":"Annals of Operations Research"},{"key":"1267_CR48","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. Political Science Quarterly, 76, 105\u2013110.","journal-title":"Political Science Quarterly"},{"key":"1267_CR49","doi-asserted-by":"crossref","first-page":"288","DOI":"10.2307\/794769","volume":"73","author":"J. B. Weaver","year":"1963","unstructured":"Weaver, J. B., & Hess, S. W. (1963). A procedure for nonpartisan districting: development of computer techniques. The Yale Law Journal, 73, 288\u2013308.","journal-title":"The Yale Law Journal"},{"key":"1267_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. International Journal of Systems Science, 40, 471\u2013477.","journal-title":"International Journal of Systems Science"},{"key":"1267_CR51","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. European Journal of Operational Research, 91, 565\u2013572.","journal-title":"European Journal of Operational Research"},{"key":"1267_CR52","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/439947","volume":"13","author":"H. P. Young","year":"1988","unstructured":"Young, H. P. (1988). Measuring compactness of legislative districts. Legislative Studies Quarterly, 13, 105\u2013111.","journal-title":"Legislative Studies Quarterly"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1267-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1267-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1267-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T02:49:58Z","timestamp":1562554198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1267-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["1267"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1267-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,9]]}}}