Best AI News โ€” Updated Every 3 Hours
Story Page
← All Stories
Home Papers Story
Papers

Fast and Effective Redistricting Optimization via Composite-Move Tabu Search

Via ArXiv cs.AI
Monday, May 11, 2026 ยท 4:00AM
Summary

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 is the contiguity co

Continue reading the full article
Read at ArXiv cs.AI
arxiv.org
Back to all stories