Optimizing representation in redistricting: dual bounds for partitioning problems with non-convex objectives
Mathematical Methods of Operations Research · 2026-06 · 103 (1-2) · 21-86
DOI: 10.1007/s00186-026-00919-5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Methods of Operations Research, online erschienen am 30.03.2026. Verfasst von Jamie Fravel und 4 weiteren Autor:innen. Die Arbeit nennt 44 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Air Force Office of Scientific Research, Office of Naval Research.
Abstract (Originalsprache)
We investigate optimization models for the purpose of computational redistricting. Our focus is on nonconvex objectives for estimating expected Black Representatives and Political Representation. The objectives are a composition of a ratio of variables and a normal distribution’s cumulative distribution function (or “probit curve"). We extend the work of Validi et al. (2022), which presented a robust implementation of contiguity constraints. By developing mixed integer linear programming models that closely approximate the parent nonlinear model, our approaches yield tight bounds on these optimization problems. We exhibit the effectiveness of these approaches on county-level data.
Förderung
- Air Force Office of Scientific Research
- Office of Naval Research
Zitieren
APA
Fravel, J., Hildebrand, R., Goedert, N., Travis, L., & Pierson, M. (2026). Optimizing representation in redistricting: dual bounds for partitioning problems with non-convex objectives. Mathematical Methods of Operations Research, 103(1-2), 21-86. https://doi.org/10.1007/s00186-026-00919-5
Vancouver
Fravel J, Hildebrand R, Goedert N, Travis L, Pierson M. Optimizing representation in redistricting: dual bounds for partitioning problems with non-convex objectives. Mathematical Methods of Operations Research. 2026;103(1-2):21-86. doi:10.1007/s00186-026-00919-5
BibTeX
@article{Fravel2026,
author = {Fravel, Jamie and Hildebrand, Robert and Goedert, Nicholas and Travis, Laurel and Pierson, Matthew},
title = {Optimizing representation in redistricting: dual bounds for partitioning problems with non-convex objectives},
journal = {Mathematical Methods of Operations Research},
year = {2026},
volume = {103},
number = {1-2},
pages = {21--86},
doi = {10.1007/s00186-026-00919-5}
}
EUVIMED