Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries

DOI10.1007/978-3-319-28697-6_26zbMath1341.91118OpenAlexW2300095776MaRDI QIDQ2806924

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

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

Cites Work

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

This page was built for publication: Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries