Optimal partisan districting on planar geographies
type: Item
instance of: scholarly article
title: Optimal partisan districting on planar geographies
zbMATH Open document ID: 1390.90463
author: Balázs Fleiner
author: Balázs Nagy
author: Attila Tasnádi
published in: CEJOR. Central European Journal of Operations Research
publication date: 2018-06-15T00:00:00Z
full work available at URL: Fleiner2017 Article OptimalPartisanDistrictingOnPl.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B12
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 91F10
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6890233
zbMATH Keywords: gerrymandering
zbMATH Keywords: computational complexity
zbMATH Keywords: dynamic programming
zbMATH Keywords: polyominoes
zbMATH Keywords: pack and crack
MaRDI profile type: Publication
OpenAlex ID: W616298831
cites work: A tabu search heuristic and adaptive memory procedure for political districting
cites work: Q4198056
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: An optimization based heuristic for political districting
cites work: Optimal redistricting under geographical constraints: why ``pack and crack'' does not work
cites work: Local search algorithms for political districting
cites work: Weighted Voronoi region algorithms for political districting
cites work: Political districting: From classical models to recent approaches
DOI: 10.1007/S10100-016-0454-7
description: scientific article; zbMATH DE number 6890233