Local search algorithms for political districting
From MaRDI portal
Publication:2482812
DOI10.1016/j.ejor.2006.08.065zbMath1146.91016MaRDI QIDQ2482812
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
Related Items
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, Some remarks on the concept of proportionality, Multiobjective scatter search for a commercial territory design 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
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
