Imposing contiguity constraints in political districting models
From MaRDI portal
Publication:5080650
DOI10.1287/OPRE.2021.2141zbMATH Open1494.90055OpenAlexW4200262891MaRDI QIDQ5080650FDOQ5080650
Authors: Hamidreza Validi, Austin Buchanan, Eugene Lykhovyd 
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2021.2141
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
integer programmingbranch-and-cutconnectivitycontiguityLagrangianpolitical redistrictingmoment-of-inertiapolicy modeling and public sector OR
Cites Work
- An implementation of Shor's \(r\)-algorithm
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- Political districting: from classical models to recent approaches
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Fast Approximation Methods for Sales Force Deployment
- School redistricting: embedding GIS tools with integer programming
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- Sales Territory Alignment: A Review and Model
- Encyclopedia of operations research and management science
- The rooted maximum node-weight connected subgraph problem
- Imposing Connectivity Constraints in Forest Planning Models
- The Optimal Diversity Management Problem
- Faster shortest-path algorithms for planar graphs
- Optimal political districting
- Local search algorithms for political districting
- Optimal Political Districting by Implicit Enumeration Techniques
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Parsimonious formulations for low-diameter clusters
- Evaluation and Optimization of Electoral Systems
- Maximum flow in directed planar graphs with vertex capacities
- An integer programming approach for fault-tolerant connected dominating sets
- Weighted Voronoi region algorithms for political districting
- The geo-graph in practice: creating United States congressional districts from census blocks
- The Maximum Weight Connected Subgraph Problem
- On imposing connectivity constraints in integer programs
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- The optimal design of low-latency virtual backbones
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
- Redistricting optimization with recombination: a local search case study
- Political districting: from classical models to recent approaches
- 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
Uses Software
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)
