RESEARCH

Fast and Effective Redistricting Optimization via Composite-Move Tabu Search

ArXiv cs.AI · Mon, 11 May 2026 04:00:00 GMT

arXiv:2605.06682v1 Announce Type: new Abstract: Spatial redistricting is a practical combinatorial optimization problem that demands high-quality solutions, rapid turnaround, and flexibility to accommodate multi-criteria objectives and interactive refinement. A central challenge

Read original source Discuss with A.S.I.S