Local search algorithms for political districting

DOI10.1016/j.ejor.2006.08.065zbMath1146.91016MaRDI QIDQ2482812

Federica Ricca, Bruno Simeone

Publication date: 24 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.065

zbMATH Keywords

local search; multicriteria optimization; political districting

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

91B12: Voting theory

91F10: History, political science

Related Items

Redistricting algorithms, Imposing Contiguity Constraints in Political Districting Models, 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, 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, New models for commercial territory design, An iterated local search algorithm for a place scheduling problem, 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, 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, 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, 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

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• How easy is local search?
• Optimal political districting
• Maximum split clustering under connectivity constraints
• A tabu search heuristic and adaptive memory procedure for political districting
• On some multicriteria arborescence problems: Complexity and algorithms
• An Optimization Based Heuristic for Political Districting
• Tabu Search—Part I
• Tabu Search—Part II
• Evaluation and Optimization of Electoral Systems
• Fair dissections of spiders, worms, and caterpillars
• Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
• Optimal Political Districting by Implicit Enumeration Techniques