Political districting: from classical models to recent approaches
From MaRDI portal
Publication:2393445
DOI10.1007/S10479-012-1267-2zbMATH Open1269.91068OpenAlexW2167696076MaRDI QIDQ2393445FDOQ2393445
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
Recommendations
Cites Work
- Title not available (Why is that?)
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A heuristic algorithm for the mini-max spanning forest problem
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Metaheuristics: A bibliography
- Optimal political districting
- Local search algorithms for political districting
- Title not available (Why is that?)
- Optimal Political Districting by Implicit Enumeration Techniques
- Political districting: From classical models to recent approaches
- Title not available (Why is that?)
- Scheduling to Minimize Interaction Cost
- Evaluation and Optimization of Electoral Systems
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- The square of a chordal graph
- Weighted Voronoi region algorithms for political districting
- A mini–max spanning forest approach to the political districting problem
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
Cited In (38)
- Towards a stochastic programming modeling framework for districting
- Mathematical political districting taking care of minority groups
- An overview of graph covering and partitioning
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- The geo-graph in practice: creating United States congressional districts from census blocks
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- A discrete districting plan
- An optimization model for aggregation of prescribed burn units
- Vertex covering with capacitated trees
- STATISTICAL PHYSICS APPROACH TO POLITICAL DISTRICTING PROBLEM
- Reconfiguration of connected graph partitions
- 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
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
- Territory design for the multi-period vehicle routing problem with time windows
- Linear-size formulations for connected planar graph partitioning and political districting
- A sample approximation solution procedure for chance-constrained districting problems
- The min-Knapsack problem with compactness constraints and applications in statistics
- A novel model for arc territory design: promoting Eulerian districts
- Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment
- A comparison between optimization tools to solve sectorization problem
- An optimization-based approach for the healthcare districting under uncertainty
- Modularity maximization to design contiguous policy zones for pandemic response
- A new integer linear programming formulation for the problem of political districting
- Axiomatic districting
- 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
- Redistricting optimization with recombination: a local search case study
- 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
- Approximation schemes for districting problems with probabilistic constraints
- An Exact Solution Method for the Political Districting Problem
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- Optimal political districting
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Imposing Contiguity Constraints in Political Districting Models
- Political districting to minimize cut edges
Uses Software
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)
