Political districting: From classical models to recent approaches

DOI10.1007/s10288-011-0177-5zbMath1231.90325OpenAlexW1990873198MaRDI QIDQ657583

Andrea Scozzari, Federica Ricca, Bruno Simeone

Publication date: 10 January 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-011-0177-5

zbMATH Keywords

surveyterritory designpolitical districting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items

Twelve surveys in operations research, Optimal partisan districting on planar geographies, A redistricting problem applied to meter reading in power distribution networks, Political districting: from classical models to recent approaches, A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment, Surveys in operations research, The geo-graph in practice: creating United States congressional districts from census blocks, Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning, Congress seat allocation using mathematical optimization, Axiomatic districting

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• A heuristic algorithm for the mini-max spanning forest problem
• The square of a chordal graph
• Optimal political districting
• A tabu search heuristic and adaptive memory procedure for political districting
• Metaheuristics: A bibliography
• Weighted Voronoi region algorithms for political districting
• Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
• Local search algorithms for political districting
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• An Optimization Based Heuristic for Political Districting
• A mini–max spanning forest approach to the political districting problem
• Evaluation and Optimization of Electoral Systems
• Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
• Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
• Scheduling to Minimize Interaction Cost
• Optimal Political Districting by Implicit Enumeration Techniques
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem