Composite-move Tabu search expands neighborhoods in redistricting optimization by moving minimal connected sets of units identified via graph articulation points, yielding better solutions and efficiency than standard Tabu search.
IEEE Transactions on Computers 48, 361–385
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Fast and Effective Redistricting Optimization via Composite-Move Tabu Search
Composite-move Tabu search expands neighborhoods in redistricting optimization by moving minimal connected sets of units identified via graph articulation points, yielding better solutions and efficiency than standard Tabu search.