Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
From MaRDI portal
Publication:4904584
DOI10.1287/OPRE.1120.1083zbMATH Open1262.90184OpenAlexW1969273296MaRDI QIDQ4904584FDOQ4904584
E. C. Sewell, Douglas M. King, Sheldon H. Jacobson, Wendy K. Tam Cho
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
Cited In (15)
- The geo-graph in practice: creating United States congressional districts from census blocks
- Finding a Maximum-Weight Convex Set in a Chordal Graph
- Parliament seating assignment problems
- 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?)
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- Imposing Contiguity Constraints in Political Districting Models
- 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)
