Mathematical programming formulations for practical political districting

DOI10.1007/978-3-030-34312-5_6zbMath1472.90057OpenAlexW3005474230MaRDI QIDQ1980466

Andrea Scozzari, Federica Ricca

Publication date: 8 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-34312-5_6

zbMATH Keywords

graph partitioningorder constraintsterritory designpolitical districtingmathematical programming formulationscontiguity criterionflow constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Discrete location and assignment (90B80)

Related Items (5)

Redistricting optimization with recombination: a local search case study ⋮ The Capacitated and Economic Districting Problem ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Mathematical political districting taking care of minority groups ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization

This page was built for publication: Mathematical programming formulations for practical political districting