Political districting to minimize cut edges
type: Item
instance of: scholarly article
title: Political districting to minimize cut edges
author: Hamidreza Validi
author: Austin Buchanan
published in: Mathematical Programming Computation
publication date: 2022-11-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7622733
zbMATH Keywords: political redistricting
zbMATH Keywords: contiguity
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut
zbMATH Keywords: cut edges
zbMATH Keywords: GerryChain
zbMATH Keywords: compactness
zbMATH Keywords: perimeter
describes a project that uses: MIPLIB
describes a project that uses: Fairmandering
describes a project that uses: GerryChain
describes a project that uses: Gurobi
describes a project that uses: BARD
MaRDI profile type: Publication
full work available at URL: s12532-022-00221-5
OpenAlex ID: W4224935844
cites work: Every Planar Map is Four Colorable
cites work: Graph Partitioning and Graph Clustering
cites work: A branch-and-price algorithm for capacitated hypergraph vertex separation
cites work: Redistricting algorithms
cites work: The \(k\)-separator problem: polyhedra, complexity and approximation results
cites work: Local metaheuristics and graph partitioning
cites work: Decomposing Matrices into Blocks
cites work: A tabu search heuristic and adaptive memory procedure for political districting
cites work: On the asymmetric representatives formulation for the vertex coloring problem
cites work: Imposing Connectivity Constraints in Forest Planning Models
cites work: Facets of the \(k\)-partition polytope
cites work: The partition problem
cites work: The equipartition polytope. II: Valid inequalities and facets
cites work: The vertex \(k\)-cut problem
cites work: Parameterized Algorithms
cites work: The Complexity of Multiterminal Cuts
cites work: Total Variation Isoperimetric Profiles
cites work: Clique-Web Facets for Multicut Polytopes
cites work: Fundamentals of parameterized complexity
cites work: On the complexity of partitioning graphs into connected subgraphs
cites work: Q4737533
cites work: Extended Formulations for Packing and Partitioning Orbitopes
cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem
cites work: The node capacitated graph partitioning problem: A computational study
cites work: Automated Redistricting Simulation Using Markov Chain Monte Carlo
cites work: Thinning out Steiner trees: a node-based model for uniform edge costs
cites work: On integer and bilevel formulations for the \(k\)-vertex cut problem
cites work: Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: The vectorization of ITPACK 2C
cites work: A catalog of steiner tree formulations
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: A cutting plane algorithm for a clustering problem
cites work: Facets of the clique partitioning polytope
cites work: Cluster analysis and mathematical programming
cites work: The planar multiterminal cut problem
cites work: Optimal political districting
cites work: Mixed-integer programming techniques for the connected max-\(k\)-cut problem
cites work: Polytopes associated with symmetry handling
cites work: Min-cut clustering
cites work: Orbitopal fixing
cites work: Packing and partitioning orbitopes
cites work: Maximum flow in directed planar graphs with vertex capacities
cites work: Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
cites work: The geo-graph in practice: creating United States congressional districts from census blocks
cites work: Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
cites work: Size-constrained graph partitioning polytopes
cites work: Partitioning a Graph into Small Pieces with Applications to Path Transversal
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Q4845371
cites work: Pruning by isomorphism in branch-and-cut

Political districting to minimize cut edges (cites work)
cites work: Exploiting orbits in symmetric ILP

Political districting to minimize cut edges (cites work)
cites work: Small covering designs by branch-and-cut

Political districting to minimize cut edges (cites work)
cites work: Symmetric ILP: Coloring and small integers

Political districting to minimize cut edges (cites work)
cites work: Symmetry in Integer Linear Programming

Political districting to minimize cut edges (cites work)
cites work: An optimization based heuristic for political districting

Political districting to minimize cut edges (cites work)
cites work: Cliques and clustering: A combinatorial approach

Political districting to minimize cut edges (cites work)
cites work: Partitioning a graph into balanced connected classes: formulations, separation and experiments

Political districting to minimize cut edges (cites work)
cites work: The clique partitioning problem: Facets and patching facets

Political districting to minimize cut edges (cites work)
cites work: Disconnecting graphs by removing vertices: a polyhedral approach

Political districting to minimize cut edges (cites work)
cites work: Modified orbital branching for structured symmetry with an application to unit commitment

Political districting to minimize cut edges (cites work)
cites work: Orbital branching

Political districting to minimize cut edges (cites work)
cites work: A computational comparison of symmetry handling methods for mixed integer programs

Political districting to minimize cut edges (cites work)
cites work: Weighted Voronoi region algorithms for political districting

Political districting to minimize cut edges (cites work)
cites work: Political districting: from classical models to recent approaches

Political districting to minimize cut edges (cites work)
cites work: Local search algorithms for political districting

Political districting to minimize cut edges (cites work)
cites work: Parsimonious formulations for low-diameter clusters

Political districting to minimize cut edges (cites work)
cites work: An overview of graph covering and partitioning

Political districting to minimize cut edges (cites work)
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions

Political districting to minimize cut edges (cites work)
cites work: Facet-defining inequalities for the simple graph partitioning polytope

Political districting to minimize cut edges (cites work)
cites work: Political districting to minimize cut edges

Political districting to minimize cut edges (cites work)
cites work: Imposing Contiguity Constraints in Political Districting Models

Political districting to minimize cut edges (cites work)
cites work: On imposing connectivity constraints in integer programs

Political districting to minimize cut edges (cites work)
cites work: Simple and improved parameterized algorithms for multiterminal cuts

Political districting to minimize cut edges (cites work)
cites work: Linear kernels for separating a graph into components of bounded size

Political districting to minimize cut edges (DOI)
DOI: 10.1007/S12532-022-00221-5