Imposing contiguity constraints in political districting models
From MaRDI portal
Publication:5080650
Recommendations
- Political districting to minimize cut edges
- Political districting: From classical models to recent approaches
- Political districting: from classical models to recent approaches
- An Exact Solution Method for the Political Districting Problem
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A hybrid heuristic for the \(p\)-median problem
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- A tabu search heuristic and adaptive memory procedure for political districting
- An implementation of Shor's \(r\)-algorithm
- An integer programming approach for fault-tolerant connected dominating sets
- An optimization based heuristic for political districting
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Encyclopedia of operations research and management science
- Evaluation and Optimization of Electoral Systems
- Fast Approximation Methods for Sales Force Deployment
- Faster shortest-path algorithms for planar graphs
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- Imposing Connectivity Constraints in Forest Planning Models
- Lagrangean heuristics for location problems
- Local search algorithms for political districting
- Maximum flow in directed planar graphs with vertex capacities
- On imposing connectivity constraints in integer programs
- Optimal Political Districting by Implicit Enumeration Techniques
- Optimal political districting
- Parsimonious formulations for low-diameter clusters
- Political districting: from classical models to recent approaches
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Sales Territory Alignment: A Review and Model
- School redistricting: embedding GIS tools with integer programming
- The Maximum Weight Connected Subgraph Problem
- The Optimal Diversity Management Problem
- The geo-graph in practice: creating United States congressional districts from census blocks
- The optimal design of low-latency virtual backbones
- The rooted maximum node-weight connected subgraph problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
- Weighted Voronoi region algorithms for political districting
Cited in
(14)- The geo-graph in practice: creating United States congressional districts from census blocks
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Vertex covering with capacitated trees
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- Linear-size formulations for connected planar graph partitioning and political districting
- The min-Knapsack problem with compactness constraints and applications in statistics
- Political districting: From classical models to recent approaches
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- Political districting: from classical models to recent approaches
- Redistricting optimization with recombination: a local search case study
- Approximation schemes for districting problems with probabilistic constraints
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- Political districting to minimize cut edges
This page was built for publication: Imposing contiguity constraints in political districting models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080650)
