Pages that link to "Item:Q2784017"
From MaRDI portal
The following pages link to An Optimization Based Heuristic for Political Districting (Q2784017):
Displayed 9 items.
- Automated Redistricting Simulation Using Markov Chain Monte Carlo (Q5066742) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- A simulated annealing approach to police district design (Q5959389) (← links)
- Territorial design for customers with demand frequency (Q6112738) (← links)
- An Exact Solution Method for the Political Districting Problem (Q6135729) (← links)
- (Q6160407) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)