The geo-graph in practice: creating United States congressional districts from census blocks
From MaRDI portal
Publication:683330
DOI10.1007/S10589-017-9936-3zbMATH Open1392.90118OpenAlexW2745697093MaRDI QIDQ683330FDOQ683330
Authors: Douglas M. King, Sheldon H. Jacobson, E. C. Sewell 
Publication date: 6 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9936-3
Recommendations
- A graph partitioning model of congressional redistricting
- scientific article; zbMATH DE number 2040751
- Political districting: From classical models to recent approaches
- Political districting: from classical models to recent approaches
- Imposing contiguity constraints in political districting models
- scientific article; zbMATH DE number 3841896
- Political geometry. Rethinking redistricting in the US with math, law, and everything in between
Cites Work
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- An Efficient Heuristic Procedure for Partitioning Graphs
- Depth-First Search and Linear Graph Algorithms
- Title not available (Why is that?)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Fast Approximation Methods for Sales Force Deployment
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- A simulated annealing approach to police district design
- Local search algorithms for political districting
- Political districting: From classical models to recent approaches
- Evaluation and Optimization of Electoral Systems
- Weighted Voronoi region algorithms for political districting
- A mini–max spanning forest approach to the political districting problem
- A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices
Cited In (10)
- Electoral economics: maximizing local representation under proportionality
- A graph partitioning model of congressional redistricting
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
- Imposing contiguity constraints in political districting models
- Title not available (Why is that?)
- Redistricting optimization with recombination: a local search case study
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Political districting to minimize cut edges
This page was built for publication: The geo-graph in practice: creating United States congressional districts from census blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683330)
