Political districting: From classical models to recent approaches
From MaRDI portal
(Redirected from Publication:657583)
Recommendations
Cites work
- A heuristic algorithm for the mini-max spanning forest problem
- A mini–max spanning forest approach to the political districting problem
- A tabu search heuristic and adaptive memory procedure for political districting
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- An optimization based heuristic for political districting
- Evaluation and Optimization of Electoral Systems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1973378 (Why is no real title available?)
- scientific article; zbMATH DE number 2040751 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Local search algorithms for political districting
- Metaheuristics: A bibliography
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
- Optimal political districting
- Optimal Political Districting by Implicit Enumeration Techniques
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- Scheduling to Minimize Interaction Cost
- The square of a chordal graph
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Weighted Voronoi region algorithms for political districting
Cited in
(23)- Optimal political districting
- Optimal partisan districting on planar geographies
- Surveys in operations research
- A tabu search heuristic and adaptive memory procedure for political districting
- Research trends in optimization of districting systems
- Mathematical programming formulations for practical political districting
- A new integer linear programming formulation for the problem of political districting
- Congress seat allocation using mathematical optimization
- Axiomatic districting
- Political districting: from classical models to recent approaches
- Local search algorithms for political districting
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Twelve surveys in operations research
- A redistricting problem applied to meter reading in power distribution networks
- STATISTICAL PHYSICS APPROACH TO POLITICAL DISTRICTING PROBLEM
- Imposing contiguity constraints in political districting models
- Optimal districting and territory design
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment
- An Exact Solution Method for the Political Districting Problem
- Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach
- The geo-graph in practice: creating United States congressional districts from census blocks
- Fifty years of operational research: 1972--2022
- Still more surveys in operations research\dots
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)
