Pages that link to "Item:Q5080650"
From MaRDI portal
The following pages link to Imposing Contiguity Constraints in Political Districting Models (Q5080650):
Displaying 6 items.
- Redistricting optimization with recombination: a local search case study (Q6068697) (← links)
- The min-Knapsack problem with compactness constraints and applications in statistics (Q6069243) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
- Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)
