Local search algorithms for political districting
From MaRDI portal
Publication:2482812
Recommendations
- A tabu search heuristic and adaptive memory procedure for political districting
- Weighted Voronoi region algorithms for political districting
- Political districting: From classical models to recent approaches
- Political districting for elections to the German Bundestag: an optimization-based multi-stage heuristic respecting administrative boundaries
- A mini–max spanning forest approach to the political districting problem
Cites work
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- Evaluation and Optimization of Electoral Systems
- Fair dissections of spiders, worms, and caterpillars
- How easy is local search?
- scientific article; zbMATH DE number 1535754 (Why is no real title available?)
- Maximum split clustering under connectivity constraints
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
- On some multicriteria arborescence problems: Complexity and algorithms
- Optimal political districting
- Optimal Political Districting by Implicit Enumeration Techniques
- Optimization by simulated annealing
- Tabu Search—Part I
- Tabu Search—Part II
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(45)- Optimal partisan districting on planar geographies
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Uniform and most uniform partitions of trees
- Multiobjective scatter search for a commercial territory design problem
- A tabu search heuristic and adaptive memory procedure for political districting
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- Political districting to minimize cut edges
- An overview of graph covering and partitioning
- Modularity maximization to design contiguous policy zones for pandemic response
- A new integer linear programming formulation for the problem of political districting
- Goal programming approach for political districting in Santa Catarina state: Brazil
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Mathematical political districting taking care of minority groups
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- A dual bounding scheme for a territory design problem
- Weighted Voronoi region algorithms for political districting
- Political districting: from classical models to recent approaches
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- An optimization-based approach for the healthcare districting under uncertainty
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- Political districting for elections to the German Bundestag: an optimization-based multi-stage heuristic respecting administrative boundaries
- A mini–max spanning forest approach to the political districting problem
- A redistricting problem applied to meter reading in power distribution networks
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- STATISTICAL PHYSICS APPROACH TO POLITICAL DISTRICTING PROBLEM
- New models for commercial territory design
- scientific article; zbMATH DE number 2040751 (Why is no real title available?)
- scientific article; zbMATH DE number 1488096 (Why is no real title available?)
- An iterated local search algorithm for a place scheduling problem
- Redistricting algorithms
- Imposing contiguity constraints in political districting models
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
- Voting Rights, Markov Chains, and Optimization by Short Bursts
- Redistricting optimization with recombination: a local search case study
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment
- Reconfiguration of connected graph partitions
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- An Exact Solution Method for the Political Districting Problem
- Linear-size formulations for connected planar graph partitioning and political districting
- Monte Carlo within simulated annealing for integral constrained optimizations
- Political districting: From classical models to recent approaches
- The geo-graph in practice: creating United States congressional districts from census blocks
- Some remarks on the concept of proportionality
- Towards a stochastic programming modeling framework for districting
This page was built for publication: Local search algorithms for political districting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482812)
