Pages that link to "Item:Q3183734"
From MaRDI portal
The following pages link to A mini–max spanning forest approach to the political districting problem (Q3183734):
Displaying 10 items.
- Political districting: From classical models to recent approaches (Q657583) (← links)
- The geo-graph in practice: creating United States congressional districts from census blocks (Q683330) (← links)
- A new integer linear programming formulation for the problem of political districting (Q2173126) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Local search algorithms for political districting (Q2482812) (← links)
- An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
- Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries (Q2806924) (← links)
- A spanning tree heuristic for regional clustering (Q4843881) (← links)
- Metropolized Multiscale Forest Recombination for Redistricting (Q5022764) (← links)