Redistricting optimization with recombination: a local search case study
From MaRDI portal
Recommendations
- Local search algorithms for political districting
- scientific article; zbMATH DE number 1016966
- Approximate local search in combinatorial optimization
- Approximate Local Search in Combinatorial Optimization
- Redundancy resolution through local optimization: A review
- Local search algorithms for the red-blue median problem
- An iterative local search approach applied to the optimal stratification problem
- A theory and algorithms for combinatorial reoptimization
- A theory and algorithms for combinatorial reoptimization
Cites work
- A formula goes to court: partisan gerrymandering and the efficiency gap
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions
- Assessing significance in a Markov chain without mixing
- Automated Redistricting Simulation Using Markov Chain Monte Carlo
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- Graph partitioning
- Imposing contiguity constraints in political districting models
- Local search algorithms for political districting
- Mathematical political districting taking care of minority groups
- Mathematical programming formulations for practical political districting
- Optimal districting and territory design
- Optimal Political Districting by Implicit Enumeration Techniques
- Optimization by simulated annealing
- Political districting to minimize cut edges
- Political districting: from classical models to recent approaches
- The geo-graph in practice: creating United States congressional districts from census blocks
Cited in
(2)
This page was built for publication: Redistricting optimization with recombination: a local search case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068697)