Political districting to minimize cut edges

DOI10.1007/s12532-022-00221-5MaRDI QIDQ2099493

Austin Buchanan, Hamidreza Validi

Publication date: 24 November 2022

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-022-00221-5

zbMATH Keywords

integer programming; compactness; contiguity; branch-and-cut; perimeter; cut edges; GerryChain; political redistricting

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C90: Applications of mathematical programming

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Uses Software

• MIPLIB
• Gurobi
• BARD
• GerryChain
• Fairmandering