Political districting to minimize cut edges
From MaRDI portal
Publication:2099493
Recommendations
- Imposing contiguity constraints in political districting models
- An Exact Solution Method for the Political Districting Problem
- A new integer linear programming formulation for the problem of political districting
- Weighted Voronoi region algorithms for political districting
- Optimal political districting
Cites work
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- A catalog of steiner tree formulations
- A computational comparison of symmetry handling methods for mixed integer programs
- A cutting plane algorithm for a clustering problem
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- An overview of graph covering and partitioning
- Automated Redistricting Simulation Using Markov Chain Monte Carlo
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Clique-Web Facets for Multicut Polytopes
- Cliques and clustering: A combinatorial approach
- Cluster analysis and mathematical programming
- Decomposing Matrices into Blocks
- Disconnecting graphs by removing vertices: a polyhedral approach
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Every Planar Map is Four Colorable
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exploiting orbits in symmetric ILP
- Extended formulations for packing and partitioning orbitopes
- Facet-defining inequalities for the simple graph partitioning polytope
- Facets of the \(k\)-partition polytope
- Facets of the clique partitioning polytope
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Fundamentals of parameterized complexity
- Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
- Graph Partitioning and Graph Clustering
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- Imposing Connectivity Constraints in Forest Planning Models
- Imposing contiguity constraints in political districting models
- Linear kernels for separating a graph into components of bounded size
- Local metaheuristics and graph partitioning
- Local search algorithms for political districting
- Maximum flow in directed planar graphs with vertex capacities
- Min-cut clustering
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Modified orbital branching for structured symmetry with an application to unit commitment
- On imposing connectivity constraints in integer programs
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- On the asymmetric representatives formulation for the vertex coloring problem
- On the complexity of partitioning graphs into connected subgraphs
- Optimal political districting
- Optimal Political Districting by Implicit Enumeration Techniques
- Orbital branching
- Orbitopal fixing
- Packing and partitioning orbitopes
- Parameterized algorithms
- Parsimonious formulations for low-diameter clusters
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Partitioning a graph into small pieces with applications to path transversal
- Political districting to minimize cut edges
- Political districting: from classical models to recent approaches
- Polytopes associated with symmetry handling
- Pruning by isomorphism in branch-and-cut
- Redistricting algorithms
- Simple and improved parameterized algorithms for multiterminal cuts
- Size-constrained graph partitioning polytopes
- Small covering designs by branch-and-cut
- Symmetric ILP: Coloring and small integers
- Symmetry in integer linear programming
- The k-separator problem: polyhedra, complexity and approximation results
- The clique partitioning problem: Facets and patching facets
- The Complexity of Multiterminal Cuts
- The equipartition polytope. II: Valid inequalities and facets
- The geo-graph in practice: creating United States congressional districts from census blocks
- The node capacitated graph partitioning problem: A computational study
- The node-deletion problem for hereditary properties is NP-complete
- The partition problem
- The planar multiterminal cut problem
- The vectorization of ITPACK 2C
- The vertex \(k\)-cut problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Total variation isoperimetric profiles
- Weighted Voronoi region algorithms for political districting
Cited in
(17)- Optimal political districting
- Political districting to minimize cut edges
- Weighted Voronoi region algorithms for political districting
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- A mini–max spanning forest approach to the political districting problem
- Measuring legislative boundaries
- Partisan gerrymandering with geographically compact districts
- Imposing contiguity constraints in political districting models
- Total variation isoperimetric profiles
- To the solution of ``territory cutting problem
- Redistricting optimization with recombination: a local search case study
- 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
- Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach
- Computational aspects of lifted cover inequalities for knapsacks with few different weights
This page was built for publication: Political districting to minimize cut edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099493)
