Imposing contiguity constraints in political districting models
Year of publication: |
2022
|
---|---|
Authors: | Validi, Hamidreza ; Buchanan, Austin ; Lykhovyd, Eugene |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 70.2022, 2, p. 867-892
|
Subject: | branch-and-cut | connectivity | contiguity | integer programming | Lagrangian | moment-of-inertia | Policy Modeling and Public Sector OR | political redistricting | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Öffentlicher Sektor | Public sector |
-
A branch-and-cut algorithm for the connected max-k-cut problem
Healy, Patrick, (2024)
-
Integer programming approaches for minimum stabbing problems
Piva, Breno, (2014)
-
Coniglio, Stefano, (2022)
- More ...
-
The optimal design of low-latency virtual backbones
Validi, Hamidreza, (2020)
-
On relaxations of the max k-cut problem formulations
Fakhimi, Ramin, (2023)
-
Optimal design of vaccination policies : a case study for Newfoundland and Labrador
Khoshbakhtian, Faraz, (2024)
- More ...