Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning

DOI10.1287/OPRE.1120.1083MaRDI QIDQ4904584zbMATHOpenAlexFDO

Authors Sheldon H. Jacobson, E. C. Sewell, Wendy K. Tam Cho, Douglas M. King

Publication date 30 January 2013

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1120.1083

zbMATH Keywords

local searchpolitical districtingplane graph partitioning

Mathematics Subject Classification ID

History, political science (91F10) Programming involving graphs or networks (90C35)

Recommendations

• 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
• Imposing contiguity constraints in political districting models
• Optimal partisan districting on planar geographies
• Weighted Voronoi region algorithms for political districting

Cited in

(18)

• Finding a maximum-weight convex set in a chordal graph
• An optimization-based approach for the healthcare districting under uncertainty
• Linear-size formulations for connected planar graph partitioning and political districting
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
• Constrained clustering via diagrams: a unified theory and its application to electoral district design
• Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
• A multi-objective districting problem applied to agricultural machinery maintenance service network
• The geo-graph in practice: creating United States congressional districts from census blocks
• Mathematical definitions of enclave and exclave, and applications
• Political districting to minimize cut edges
• 3D geo-graphs: efficient flip verification for the spherical zoning problem
• Parliament seating assignment problems
• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• Dynamic design of sales territories
• scientific article; zbMATH DE number 7683726 (Why is no real title available?)
• Redistricting optimization with recombination: a local search case study
• Imposing contiguity constraints in political districting models

This page was built for publication: Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning

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