The geo-graph in practice: creating United States congressional districts from census blocks

DOI10.1007/S10589-017-9936-3MaRDI QIDQ683330zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph partitioningplanar graphsgraph connectivitygeographic districting

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices
• A mini–max spanning forest approach to the political districting problem
• A simulated annealing approach to police district design
• A tabu search heuristic and adaptive memory procedure for political districting
• An Efficient Heuristic Procedure for Partitioning Graphs
• An optimization based heuristic for political districting
• Depth-First Search and Linear Graph Algorithms
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
• Evaluation and Optimization of Electoral Systems
• Fast Approximation Methods for Sales Force Deployment
• Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
• Local search algorithms for political districting
• Political districting: From classical models to recent approaches
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• Weighted Voronoi region algorithms for political districting

Cited in

(10)

• scientific article; zbMATH DE number 2040751 (Why is no real title available?)
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
• A graph partitioning model of congressional redistricting
• Political districting to minimize cut edges
• Electoral economics: maximizing local representation under proportionality
• 3D geo-graphs: efficient flip verification for the spherical zoning problem
• Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
• Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
• Redistricting optimization with recombination: a local search case study
• Imposing contiguity constraints in political districting models

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)