Political districting: from classical models to recent approaches
From MaRDI portal
Publication:2393445
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1973378 (Why is no real title available?)
- scientific article; zbMATH DE number 2040751 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A heuristic algorithm for the mini-max spanning forest problem
- A mini–max spanning forest approach to the political districting problem
- A tabu search heuristic and adaptive memory procedure for political districting
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- An optimization based heuristic for political districting
- Evaluation and Optimization of Electoral Systems
- Local search algorithms for political districting
- Metaheuristics: A bibliography
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
- Optimal Political Districting by Implicit Enumeration Techniques
- Optimal political districting
- Political districting: From classical models to recent approaches
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- Scheduling to Minimize Interaction Cost
- The square of a chordal graph
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Weighted Voronoi region algorithms for political districting
Cited in
(43)- An optimization-based approach for the healthcare districting under uncertainty
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
- Linear-size formulations for connected planar graph partitioning and political districting
- A discrete districting plan
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- A sample approximation solution procedure for chance-constrained districting problems
- Political districting: From classical models to recent approaches
- The min-Knapsack problem with compactness constraints and applications in statistics
- Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach
- An overview of graph covering and partitioning
- An optimization model for aggregation of prescribed burn units
- STATISTICAL PHYSICS APPROACH TO POLITICAL DISTRICTING PROBLEM
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Goal programming approach for political districting in Santa Catarina state: Brazil
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- Towards a stochastic programming modeling framework for districting
- A novel model for arc territory design: promoting Eulerian districts
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- Vertex covering with capacitated trees
- Research trends in optimization of districting systems
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- The geo-graph in practice: creating United States congressional districts from census blocks
- Mathematical programming formulations for practical political districting
- Political districting to minimize cut edges
- Reconfiguration of connected graph partitions
- Approximation schemes for districting problems with probabilistic constraints
- Modularity maximization to design contiguous policy zones for pandemic response
- A new integer linear programming formulation for the problem of political districting
- Axiomatic districting
- Optimal political districting
- Mathematical political districting taking care of minority groups
- Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- Simulation models to support the preliminary electoral results program for the Mexican electoral institute
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- A comparison between optimization tools to solve sectorization problem
- Optimal districting and territory design
- An Exact Solution Method for the Political Districting Problem
- Redistricting optimization with recombination: a local search case study
- Territory design for the multi-period vehicle routing problem with time windows
- Imposing contiguity constraints in political districting models
This page was built for publication: Political districting: from classical models to recent approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393445)
