Pages that link to "Item:Q5080650"
From MaRDI portal
The following pages link to Imposing Contiguity Constraints in Political Districting Models (Q5080650):
Displaying 12 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)
- Political districting to minimize cut edges (Q2099493) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- 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)
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks (Q6565391) (← links)