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

DOI10.1287/OPRE.1120.1083zbMATH Open1262.90184OpenAlexW1969273296MaRDI QIDQ4904584FDOQ4904584

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

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

zbMATH Keywords

local searchpolitical districtingplane graph partitioning

Mathematics Subject Classification ID

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

Cited In (17)

• The geo-graph in practice: creating United States congressional districts from census blocks
• Parliament seating assignment problems
• Imposing contiguity constraints in political districting models
• A multi-objective districting problem applied to agricultural machinery maintenance service network
• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• Dynamic design of sales territories
• An optimization-based approach for the healthcare districting under uncertainty
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
• Redistricting optimization with recombination: a local search case study
• Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
• Title not available (Why is that?)
• Constrained clustering via diagrams: a unified theory and its application to electoral district design
• 3D geo-graphs: efficient flip verification for the spherical zoning problem
• Finding a maximum-weight convex set in a chordal graph
• Mathematical definitions of enclave and exclave, and applications
• 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: 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)