Imposing Contiguity Constraints in Political Districting Models
From MaRDI portal
Publication:5080650
DOI10.1287/opre.2021.2141zbMath1494.90055OpenAlexW4200262891MaRDI QIDQ5080650
Hamidreza Validi, Eugene Lykhovyd, Austin Buchanan
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
integer programmingconnectivityLagrangiancontiguitybranch-and-cutpolitical redistrictingmoment-of-inertiapolicy modeling and public sector OR
Related Items
Constraint-based electoral districting using a new compactness measure: an application to Portugal ⋮ Redistricting optimization with recombination: a local search case study ⋮ The min-Knapsack problem with compactness constraints and applications in statistics ⋮ 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 ⋮ Political districting to minimize cut edges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Maximum flow in directed planar graphs with vertex capacities
- The geo-graph in practice: creating United States congressional districts from census blocks
- Optimal political districting
- An implementation of Shor's \(r\)-algorithm
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- On imposing connectivity constraints in integer programs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- A tabu search heuristic and adaptive memory procedure for political districting
- Parsimonious formulations for low-diameter clusters
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints
- Weighted Voronoi region algorithms for political districting
- Political districting: from classical models to recent approaches
- Local search algorithms for political districting
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- An Optimization Based Heuristic for Political Districting
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
- Sales Territory Alignment: A Review and Model
- Fast Approximation Methods for Sales Force Deployment
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- Encyclopedia of Operations Research and Management Science
- Evaluation and Optimization of Electoral Systems
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
- School redistricting: embedding GIS tools with integer programming
- Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
- The Rooted Maximum Node-Weight Connected Subgraph Problem
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- The Optimal Design of Low-Latency Virtual Backbones
- Imposing Connectivity Constraints in Forest Planning Models
- The Maximum Weight Connected Subgraph Problem
- The Optimal Diversity Management Problem
- Optimal Political Districting by Implicit Enumeration Techniques
- Faster shortest-path algorithms for planar graphs
