Political Districting to Minimize County Splits

References

• Adler WT, Wang SSH (2019) Response to Cho and Liu, “Sampling from complicated and unknown distributions: Monte Carlo and Markov chain Monte Carlo methods for redistricting.” Phys. A 516:591–593.Crossref, Google Scholar
• Alès Z, Knippel A (2020) The k-partitioning problem: Formulations and branch-and-cut. Networks 76(3):323–349.Crossref, Google Scholar
• Altman M (1997) The computational complexity of automated redistricting: Is automation the answer? Rutgers Comput. Tech. Law J. 23:81–142.Google Scholar
• Altman M, McDonald MP (2011) BARD: Better automated redistricting. J. Statist. Software 42(4):1–28.Crossref, Google Scholar
• Arredondo V, Martínez-Panero M, Peña T, Ricca F (2021) Mathematical political districting taking care of minority groups. Ann. Oper. Res. 305(1):375–402.Crossref, Google Scholar
• Autry EA, Carter D, Herschlag GJ, Hunter Z, Mattingly JC (2021) Metropolized multiscale forest recombination for redistricting. Multiscale Model. Simulation 19(4):1885–1914.Crossref, Google Scholar
• Balinski ML, Young HP (2010) Fair Representation: Meeting the Ideal of One Man, One Vote, 2nd ed. (Brookings Institution Press, Washington, DC).Google Scholar
• Ballotpedia (2023) State legislative districts. Accessed February 17, 2023, https://ballotpedia.org/State_Legislative_Districts.Google Scholar
• Becker A, Gold D (2022) The gameability of redistricting criteria. J. Comput. Soc. Sci. 5:1735–1777.Crossref, Google Scholar
• Becker A, Solomon J (2022) Redistricting algorithms. Duchin M, Walch O, eds. Political Geometry: Rethinking Redistricting in the US with Math, Law, and Everything in Between (Birkhauser, Cham, Switzerland), 303–340.Crossref, Google Scholar
• Belotti P, Buchanan A, Ezazipour S (2023) Political districting to optimize the Polsby–Popper compactness score with application to voting rights. Optimization Online, ePub ahead of print May 19, https://optimization-online.org/?p=23021.Google Scholar
• Birge JR (1983) Redistricting to maximize the preservation of political boundaries. Soc. Sci. Res. 12(3):205–214.Crossref, Google Scholar
• Borndörfer R, Ferreira CE, Martin A (1998) Decomposing matrices into blocks. SIAM J. Optim. 9(1):236–269.Crossref, Google Scholar
• Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144(1):12–26.Crossref, Google Scholar
• Bradley PS, Bennett KP, Demiriz A (2000) Constrained k-means clustering. Technical Report No. MSR-TR-2000-65, Microsoft Research, Redmond, WA.Google Scholar
• Bullock CS III (2010) Redistricting: The Most Political Activity in America (Rowman & Littlefield Publishers, Lanham, MD).Google Scholar
• Campêlo M, Campos VA, Corrêa RC (2008) On the asymmetric representatives formulation for the vertex coloring problem. Discrete Appl. Math. 156(7):1097–1111.Crossref, Google Scholar
• Carter D, Hunter Z, Teague D, Herschlag G, Mattingly J (2020) Optimal legislative county clustering in North Carolina. Statist. Public Policy 7(1):19–29.Crossref, Google Scholar
• Carvajal R, Constantino M, Goycoolea M, Vielma JP, Weintraub A (2013) Imposing connectivity constraints in forest planning models. Oper. Res. 61(4):824–836.Link, Google Scholar
• Cervas J (2022) Report of the Special Master, Harkenrider v. Hochul. Accessed February 20, 2023, http://jonathancervas.com/2022/NY/CERVAS-SM-NY-2022.pdf.Google Scholar
• Cervas JR, Grofman B (2020) Tools for identifying partisan gerrymandering with an application to congressional districting in Pennsylvania. Political Geography 76:102069.Crossref, Google Scholar
• Chen J, Rodden J (2013) Unintentional gerrymandering: Political geography and electoral bias in legislatures. Quart. J. Political Sci. 8(3):239–269.Crossref, Google Scholar
• Cho WKT, Liu YY (2018) Sampling from complicated and unknown distributions: Monte Carlo and Markov chain Monte Carlo methods for redistricting. Phys. A 506:170–178.Crossref, Google Scholar
• Chopra S, Filipecki B, Lee K, Ryu M, Shim S, Van Vyve M (2017) An extended formulation of the convex recoloring problem on a tree. Math. Programming 165(2):529–548.Crossref, Google Scholar
• Clelland J, Colgate H, DeFord D, Malmskog B, Sancier-Barbosa F (2022) Colorado in context: Congressional redistricting and competing fairness criteria in Colorado. J. Comput. Soc. Sci. 5:189–226.Crossref, Google Scholar
• Cohen-Addad V, Klein PN, Young NE (2018) Balanced centroidal power diagrams for redistricting. Proc. 26th ACM SIGSPATIAL Internat. Conf. Adv. Geographic Inform. Systems (ACM, New York), 389–396.Google Scholar
• Cova TJ, Church RL (2000) Contiguity constraints for single-region site search problems. Geographical Anal. 32(4):306–329.Crossref, Google Scholar
• Davis M, Strigari F, Underhill W, Wice JM, Zamarripa C (2019) Redistricting law 2020. Natl. Conf. State Legislatures (NCSL, Washington, DC).Google Scholar
• DeFord D, Duchin M (2019) Redistricting reform in Virginia: Districting criteria in context. Virginia Policy Rev. 12(2): 120–146.Google Scholar
• DeFord D, Duchin M, Solomon J (2021) Recombination: A family of Markov chains for redistricting. Harvard Data Sci. Rev. 3(1).Google Scholar
• DRA (2023) Dave’s redistricting. Accessed February 17, 2023, https://davesredistricting.org/.Google Scholar
• Duchin M, Schoenbach G (2023) Redistricting for proportionality. Forum 20(3–4):371–393.Google Scholar
• Duchin M, Walch O, eds. (2022) Political Geometry: Rethinking Redistricting in the US with Math, Law, and Everything in Between (Birkhauser, Cham, Switzerland).Crossref, Google Scholar
• Dyer ME, Frieze AM (1985) On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10(2):139–153.Crossref, Google Scholar
• Ferreira CE, Martin A, de Souza CC, Weismantel R, Wolsey LA (1996) Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Programming 74(3):247–266.Crossref, Google Scholar
• Fifield B, Higgins M, Imai K, Tarr A (2020) Automated redistricting simulation using Markov chain Monte Carlo. J. Comput. Graphical Statist. 29(4):715–728.Google Scholar
• Fischetti M, Leitner M, Ljubić I, Luipersbeck M, Monaci M, Resch M, Salvagnin D, Sinnl M (2017) Thinning out Steiner trees: A node-based model for uniform edge costs. Math. Programming Comput. 9(2):203–229.Crossref, Google Scholar
• Garfinkel RS, Nemhauser GL (1970) Optimal political districting by implicit enumeration techniques. Management Sci. 16(8):B-495–B-508.Link, Google Scholar
• Gladkova T, Goldbloom-Helzner A, Khan M, Kolstoe B, Noory J, Schutzman Z, Stucky E, Weighill T (2019) Discussion of locality splitting measures. https://github.com/vrdi/splitting/blob/master/SplittingReport.pdf.Google Scholar
• Goderbauer S, Winandy J (2018) Political districting problem: Literature review and discussion with regard to federal elections in Germany. Accessed February 20, 2023, https://www.or.rwth-aachen.de/files/research/repORt/LitSurvey_PoliticalDistricting__Goderbauer_Winandy_20181024.pdf.Google Scholar
• Grofman B (1985) Criteria for districting: A social science perspective. UCLA Law Rev. 33(1):77–184.Google Scholar
• Guo D, Jin H (2011) iRedistrict: Geovisual analytics for redistricting optimization. J. Visual Languages Comput. 22(4):279–289.Crossref, Google Scholar
• Gurnee W, Shmoys DB (2021) Fairmandering: A column generation heuristic for fairness-optimized political districting. SIAM Conf. Appl. Comput. Discrete Algorithms (ACDA21) (SIAM, Philadelphia), 88–99.Google Scholar
• Gutiérrez-Andrade MÁ, Rincón-García EA, de-los Cobos-Silva SG, Lara-Velázquez P, Mora-Gutiérrez RA, Ponsich A (2019) Simulated annealing and artificial bee colony for the redistricting process in Mexico. INFORMS J. Appl. Analytics 49(3):189–200.Link, Google Scholar
• Hebert JG, Vandenberg ME, Smith P (2010) The Realist’s Guide to Redistricting: Avoiding the Legal Pitfalls (American Bar Association, Chicago).Google Scholar
• Herschlag G, Kang HS, Luo J, Graves CV, Bangia S, Ravier R, Mattingly JC (2020) Quantifying gerrymandering in North Carolina. Statist. Public Policy 7(1):30–38.Crossref, Google Scholar
• Hess S, Weaver J, Siegfeldt H, Whelan J, Zitlau P (1965) Nonpartisan political redistricting by computer. Oper. Res. 13(6):998–1006.Link, Google Scholar
• Kenny CT, McCartan C, Simko T, Kuriwaki S, Imai K (2023) Widespread partisan gerrymandering mostly cancels nationally, but reduces electoral competition. Proc. Natl. Acad. Sci. USA 120(25):e2217322120.Crossref, Google Scholar
• Kim MJ (2019) Give-and-take heuristic model to political redistricting problems. Spatial Inform. Res. 27:539–552.Crossref, Google Scholar
• Kim M, Xiao N (2017) Contiguity-based optimization models for political redistricting problems. Internat. J. Appl. Geospatial Res. 8(4):1–18.Crossref, Google Scholar
• King DM, Jacobson SH, Sewell EC (2015) Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning. Math. Programming 149(1–2):425–457.Crossref, Google Scholar
• King DM, Jacobson SH, Sewell EC (2018) The geo-graph in practice: Creating United States congressional districts from census blocks. Comput. Optim. Appl. 69(1):25–49.Crossref, Google Scholar
• King DM, Jacobson SH, Sewell EC, Cho WKT (2012) Geo-graphs: An efficient model for enforcing contiguity and hole constraints in planar graph partitioning. Oper. Res. 60(5):1213–1228.Link, Google Scholar
• Levin HA, Friedler SA (2019) Automated congressional redistricting. J. Experiment. Algorithmics 24(1):1–10.Crossref, Google Scholar
• Levitt J (2010) A Citizen’s Guide to Redistricting (Brennan Center for Justice at New York University School of Law, New York).Google Scholar
• Liu YY, Cho WKT, Wang S (2016) PEAR: A massively parallel evolutionary computation approach for political redistricting optimization and analysis. Swarm Evolutionary Comput. 30:78–92.Crossref, Google Scholar
• McCartan C, Imai K (2023) Sequential Monte Carlo for sampling balanced and compact redistricting plans. Ann. Appl. Statist. 17(4):3300–3323.Crossref, Google Scholar
• McCartan C, Kenny CT, Simko T, Garcia G III, Wang K, Wu M, Kuriwaki S, Imai K (2022b) Simulated redistricting plans for the analysis and evaluation of redistricting in the United States. Sci. Data 9(1):689.Crossref, Google Scholar
• McCartan C, Kenny C, Simko T, Kuriwaki S, Garcia G III, Wang K, Wu M, Imai K (2022a) ALARM project. Accessed February 10, 2023, https://alarm-redist.github.io/fifty-states/.Google Scholar
• Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Management Sci. 44(8):1100–1114.Link, Google Scholar
• MGGG (2023) GerryChain 0.2.20. Accessed February 20, 2023, https://gerrychain.readthedocs.io/en/latest/.Google Scholar
• Miller S (2007) The problem of redistricting: The use of centroidal Voronoi diagrams to build unbiased congressional districts. Senior project, Whitman College, Walla Walla, WA.Google Scholar
• Nagle J (2022) Euler’s formula determines the minimum number of splits in maps of election districts. Preprint, submitted June 17, http://dx.doi.org/10.2139/ssrn.4115039.Google Scholar
• NCSL (2021) Redistricting criteria. Accessed February 17, 2023, https://www.ncsl.org/elections-and-campaigns/2020-redistricting-criteria.Google Scholar
• Norman SK, Camm JD (2003) The Kentucky redistricting problem: Mixed-integer programming model. Technical Report No. 03-04, College of Business Administration, Northern Arizona University, Flagstaff.Google Scholar
• Oehrlein J, Haunert JH (2017) A cutting-plane method for contiguity-constrained spatial aggregation. J. Spatial Inform. Sci. 2017(15):89–120.Google Scholar
• Olson B (2022) Impartial automatic redistricting. Accessed February 17, 2023, https://bdistricting.com/2020/.Google Scholar
• Önal H, Patrick KT (2016) A mathematical programming approach to political redistricting with compactness and community integrity considerations. Technical report, University of Illinois at Urbana-Champaign, Champaign.Google Scholar
• Princeton Gerrymandering Project (2023) Redistricting report card. Accessed February 17, 2023, https://gerrymander.princeton.edu/redistricting-report-card/.Google Scholar
• Redistricting Data Hub (2021a) Download data. Accessed February 20, 2023, https://redistrictingdatahub.org/data/download-data/.Google Scholar
• Redistricting Data Hub (2021b) States that adjust the census data for redistricting. Accessed February 20, 2023, https://redistrictingdatahub.org/reports/states-that-adjust-the-census-data-for-redistricting/.Google Scholar
• Ricca F, Simeone B (2008) Local search algorithms for political districting. Eur. J. Oper. Res. 189(3):1409–1426.Crossref, Google Scholar
• Ricca F, Scozzari A, Simeone B (2008) Weighted Voronoi region algorithms for political districting. Math. Comput. Model. 48(9–10):1468–1477.Crossref, Google Scholar
• Ricca F, Scozzari A, Simeone B (2013) Political districting: From classical models to recent approaches. Ann. Oper. Res. 204(1):271–299.Crossref, Google Scholar
• Shirabe T (2005) A model of contiguity for spatial unit allocation. Geographical Anal. 37(1):2–16.Crossref, Google Scholar
• Shirabe T (2009) Districting modeling with exact contiguity constraints. Environ. Planning B Planning Design 36(6):1053–1066.Crossref, Google Scholar
• Svec L, Burden S, Dilley A (2007) Applying Voronoi diagrams to the redistricting problem. UMAP J. 28(3):313–329.Google Scholar
• Swamy R, King DM, Jacobson SH (2023) Multiobjective optimization for politically fair districting: A scalable multilevel approach. Oper. Res. 71(2):536–562.Link, Google Scholar
• U.S. Census Bureau (1994) Census Tracts and Block Numbering Areas. Geographic Areas Reference Manual (U.S. Department of Commerce, Washington, DC).Google Scholar
• U.S. Census Bureau (2021a) Decennial Census P.L. 94-171 redistricting data. Accessed February 20, 2023, https://www.census.gov/programs-surveys/decennial-census/about/rdo/summary-files.html.Google Scholar
• U.S. Census Bureau (2021b) Disclosure avoidance for the 2020 Census: An introduction. Accessed February 20, 2023, https://www.census.gov/library/publications/2021/decennial/2020-census-disclosure-avoidance-handbook.html.Google Scholar
• U.S. Census Bureau (2021c) TIGER/line shapefiles. Accessed February 20, 2023, https://www.census.gov/geographies/mapping-files/time-series/geo/tiger-line-file.html.Google Scholar
• U.S. Census Bureau (2022) State legislative districts. Accessed February 20, 2023, https://www.census.gov/programs-surveys/decennial-census/about/rdo/state-legislative-district.html.Google Scholar
• U.S. Census Bureau (2023) Congressional districts. Accessed February 20, 2023, https://www.census.gov/programs-surveys/decennial-census/about/rdo/congressional-districts.html.Google Scholar
• Validi H, Buchanan A (2022) Political districting to minimize cut edges. Math. Programming Comput. 14:623–672.Crossref, Google Scholar
• Validi H, Buchanan A, Lykhovyd E (2022) Imposing contiguity constraints in political districting models. Oper. Res. 70(2):867–892.Link, Google Scholar
• Vickrey W (1961) On the prevention of gerrymandering. Political Sci. Quart. 76(1):105–110.Crossref, Google Scholar
• Wachspress J, Adler WT (2021) Split decisions: Guidance for measuring locality preservation in district maps. Center for Democracy & Technology. Accessed February 20, 2023, https://cdt.org/wp-content/uploads/2021/11/2021-11-04-Locality-splitting-report-final.pdf.Google Scholar
• Wang Y, Buchanan A, Butenko S (2017) On imposing connectivity constraints in integer programs. Math. Programming 166(1–2):241–271.Crossref, Google Scholar
• Zoltners AA, Sinha P (1983) Sales territory alignment: A review and model. Management Sci. 29(11):1237–1256.Link, Google Scholar