Pages that link to "Item:Q2099493"
From MaRDI portal
The following pages link to Political districting to minimize cut edges (Q2099493):
Displaying 14 items.
- Measuring legislative boundaries (Q459392) (← links)
- Optimal political districting (Q1360126) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
- Partisan gerrymandering with geographically compact districts (Q4611268) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Total Variation Isoperimetric Profiles (Q5203820) (← links)
- Redistricting optimization with recombination: a local search case study (Q6068697) (← 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)