Political districting: From classical models to recent approaches

DOI10.1007/S10288-011-0177-5zbMATH Open1231.90325OpenAlexW1990873198MaRDI QIDQ657583FDOQ657583

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

Recommendations

• Political districting: from classical models to recent approaches
• Mathematical programming formulations for practical political districting
• An Exact Solution Method for the Political Districting Problem
• Optimal political districting
• Imposing contiguity constraints in political districting models

zbMATH Keywords

surveyterritory designpolitical districting

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• A tabu search heuristic and adaptive memory procedure for political districting
• The geo-graph in practice: creating United States congressional districts from census blocks
• Local search algorithms for political districting
• Surveys in operations research
• A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment
• Optimal partisan districting on planar geographies
• Twelve surveys in operations research
• STATISTICAL PHYSICS APPROACH TO POLITICAL DISTRICTING PROBLEM
• Congress seat allocation using mathematical optimization
• A redistricting problem applied to meter reading in power distribution networks
• A new integer linear programming formulation for the problem of political districting
• Axiomatic districting
• Political districting: from classical models to recent approaches
• An Exact Solution Method for the Political Districting Problem
• Optimal political districting
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning

Uses Software

• Tabu search

This page was built for publication: Political districting: From classical models to recent approaches

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