Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
From MaRDI portal
Publication:4904584
DOI10.1287/opre.1120.1083zbMath1262.90184OpenAlexW1969273296MaRDI QIDQ4904584
Edward C. Sewell, Jacobson, Sheldon H., 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
Related Items (15)
A multi-criteria police districting problem for the efficient and effective design of patrol sector ⋮ Dynamic design of sales territories ⋮ Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm ⋮ Imposing Contiguity Constraints in Political Districting Models ⋮ An optimization-based approach for the healthcare districting under uncertainty ⋮ Redistricting optimization with recombination: a local search case study ⋮ 3D geo-graphs: efficient flip verification for the spherical zoning problem ⋮ Unnamed Item ⋮ Parliament seating assignment problems ⋮ The geo-graph in practice: creating United States congressional districts from census blocks ⋮ Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints ⋮ A multi-objective districting problem applied to agricultural machinery maintenance service network ⋮ Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ 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
