Political districting to minimize cut edges (Q2099493): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Fairmandering / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GerryChain / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARD / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12532-022-00221-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4224935844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for capacitated hypergraph vertex separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redistricting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-separator problem: polyhedra, complexity and approximation results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2912418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Matrices into Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic and adaptive memory procedure for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetric representatives formulation for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Connectivity Constraints in Forest Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the \(k\)-partition polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartition polytope. II: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex \(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Variation Isoperimetric Profiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Web Facets for Multicut Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Formulations for Packing and Partitioning Orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node capacitated graph partitioning problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Redistricting Simulation Using Markov Chain Monte Carlo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer and bilevel formulations for the \(k\)-vertex cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Political Districting by Implicit Enumeration Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vectorization of ITPACK 2C / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar multiterminal cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer programming techniques for the connected max-\(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes associated with symmetry handling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbitopal fixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and partitioning orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum flow in directed planar graphs with vertex capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geo-graph in practice: creating United States congressional districts from census blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-constrained graph partitioning polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a Graph into Small Pieces with Applications to Path Transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning by isomorphism in branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting orbits in symmetric ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small covering designs by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric ILP: Coloring and small integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Based Heuristic for Political Districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques and clustering: A combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into balanced connected classes: formulations, separation and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique partitioning problem: Facets and patching facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnecting graphs by removing vertices: a polyhedral approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified orbital branching for structured symmetry with an application to unit commitment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of symmetry handling methods for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Voronoi region algorithms for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Political districting: from classical models to recent approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious formulations for low-diameter clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of graph covering and partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet-defining inequalities for the simple graph partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Political districting to minimize cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Contiguity Constraints in Political Districting Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On imposing connectivity constraints in integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and improved parameterized algorithms for multiterminal cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear kernels for separating a graph into components of bounded size / rank
 
Normal rank

Latest revision as of 23:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Political districting to minimize cut edges
scientific article

    Statements

    Political districting to minimize cut edges (English)
    0 references
    0 references
    0 references
    24 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    political redistricting
    0 references
    contiguity
    0 references
    integer programming
    0 references
    branch-and-cut
    0 references
    cut edges
    0 references
    GerryChain
    0 references
    compactness
    0 references
    perimeter
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references