A mini–max spanning forest approach to the political districting problem
From MaRDI portal
Publication:3183734
DOI10.1080/00207720802645246zbMath1178.90339OpenAlexW2009527376MaRDI QIDQ3183734
Publication date: 21 October 2009
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720802645246
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Application models in control theory (93C95) History, political science (91F10)
Related Items (5)
Political districting: from classical models to recent approaches ⋮ An optimization-based approach for the healthcare districting under uncertainty ⋮ Political districting: From classical models to recent approaches ⋮ The geo-graph in practice: creating United States congressional districts from census blocks ⋮ Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries
Cites Work
- How easy is local search?
- A heuristic algorithm for the mini-max spanning forest problem
- A branch-and-bound algorithm for the mini-max spanning forest problem
- Analysis and design of electoral systems
- A tabu search heuristic and adaptive memory procedure for political districting
- An Optimization Based Heuristic for Political Districting
- How to divide a territory? A new simple differential formalism for optimization of set functions
This page was built for publication: A mini–max spanning forest approach to the political districting problem
