Optimal partisan districting on planar geographies

DOI10.1007/s10100-016-0454-7zbMath1390.90463OpenAlexW616298831MaRDI QIDQ1642801

Attila Tasnádi, Balázs Nagy, Balázs Fleiner

Publication date: 15 June 2018

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: http://unipub.lib.uni-corvinus.hu/6378/1/Fleiner2017_Article_OptimalPartisanDistrictingOnPl.pdf

zbMATH Keywords

computational complexitydynamic programmingpolyominoesgerrymanderingpack and crack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Voting theory (91B12) Dynamic programming (90C39) History, political science (91F10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (5)

Algorithms for gerrymandering over graphs ⋮ Gerrymandering on graphs: computational complexity and parameterized algorithms ⋮ Reconfiguration of connected graph partitions ⋮ Optimality and fairness of partisan gerrymandering ⋮ Editorial

Cites Work

• Unnamed Item
• Political districting: From classical models to recent approaches
• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• A tabu search heuristic and adaptive memory procedure for political districting
• Weighted Voronoi region algorithms for political districting
• Local search algorithms for political districting
• An Optimization Based Heuristic for Political Districting
• Optimal Political Districting by Implicit Enumeration Techniques

This page was built for publication: Optimal partisan districting on planar geographies