Political districting: from classical models to recent approaches
From MaRDI portal
Publication:2393445
DOI10.1007/s10479-012-1267-2zbMath1269.91068OpenAlexW2167696076MaRDI QIDQ2393445
Federica Ricca, Andrea Scozzari, Bruno Simeone
Publication date: 8 August 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1267-2
Related Items
Towards a stochastic programming modeling framework for districting, An optimization model for aggregation of prescribed burn units, A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas, An overview of graph covering and partitioning, Territory design for the multi-period vehicle routing problem with time windows, Imposing Contiguity Constraints in Political Districting Models, 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, An optimization-based approach for the healthcare districting under uncertainty, 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, Primal and dual bounds for the vertex \(p\)-median problem with balance constraints, Redistricting optimization with recombination: a local search case study, A sample approximation solution procedure for chance-constrained districting problems, The min-Knapsack problem with compactness constraints and applications in statistics, Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment, Reconfiguration of connected graph partitions, Approximation schemes for districting problems with probabilistic constraints, An Exact Solution Method for the Political Districting Problem, Constrained clustering via diagrams: a unified theory and its application to electoral district design, 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, An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation, Mathematical political districting taking care of minority groups, A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, A novel model for arc territory design: promoting Eulerian districts, A discrete districting plan, Political districting to minimize cut edges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Political districting: From classical models to recent approaches
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- A heuristic algorithm for the mini-max spanning forest problem
- The square of a chordal graph
- Optimal political districting
- A tabu search heuristic and adaptive memory procedure for political districting
- Metaheuristics: A bibliography
- Weighted Voronoi region algorithms for political districting
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- Local search algorithms for political districting
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- An Optimization Based Heuristic for Political Districting
- A mini–max spanning forest approach to the political districting problem
- Evaluation and Optimization of Electoral Systems
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- Scheduling to Minimize Interaction Cost
- Optimal Political Districting by Implicit Enumeration Techniques
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
