Political districting for elections to the German Bundestag: an optimization-based multi-stage heuristic respecting administrative boundaries

DOI10.1007/978-3-319-28697-6_26MaRDI QIDQ2806924zbMATH OpenOpenAlexFDO

Authors Sebastian Goderbauer

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_26

Mathematics Subject Classification ID

History, political science (91F10) Voting theory (91B12)

Recommendations

• Optimal political districting
• Local search algorithms for political districting
• Mathematical programming formulations for practical political districting
• A tabu search heuristic and adaptive memory procedure for political districting
• A mini–max spanning forest approach to the political districting problem

Cites work

• A mini–max spanning forest approach to the political districting problem
• An optimization based heuristic for political districting
• Fair dissections of spiders, worms, and caterpillars
• Most uniform path partitioning and its use in image processing
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size

Cited in

(6)

• A tabu search heuristic and adaptive memory procedure for political districting
• Mathematical political districting taking care of minority groups
• Local search algorithms for political districting
• Weighted Voronoi region algorithms for political districting
• A mini–max spanning forest approach to the political districting problem
• Design of electoral districts in Ecuador

This page was built for publication: Political districting for elections to the German Bundestag: an optimization-based multi-stage heuristic respecting administrative boundaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806924)