Redistricting optimization with recombination: a local search case study

DOI10.1016/j.cor.2023.106369OpenAlexW4385605351MaRDI QIDQ6068697

Kiera W. Dobbs, Douglas M. King, Jacobson, Sheldon H.

Publication date: 13 November 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106369

zbMATH Keywords

local searchrecombinationpolitical redistrictingpolitical fairness

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• The geo-graph in practice: creating United States congressional districts from census blocks
• Mathematical programming formulations for practical political districting
• A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions
• Political districting to minimize cut edges
• Mathematical political districting taking care of minority groups
• Political districting: from classical models to recent approaches
• Local search algorithms for political districting
• A Formula Goes to Court: Partisan Gerrymandering and the Efficiency Gap
• Assessing significance in a Markov chain without mixing
• Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
• Automated Redistricting Simulation Using Markov Chain Monte Carlo
• Imposing Contiguity Constraints in Political Districting Models
• Optimal Political Districting by Implicit Enumeration Techniques
• Optimal Districting and Territory Design

This page was built for publication: Redistricting optimization with recombination: a local search case study