Pages that link to "Item:Q2389781"
From MaRDI portal
The following pages link to Weighted Voronoi region algorithms for political districting (Q2389781):
Displaying 15 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)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A new integer linear programming formulation for the problem of political districting (Q2173126) (← links)
- Goal programming approach for political districting in Santa Catarina state: Brazil (Q2178309) (← links)
- Mathematical political districting taking care of minority groups (Q2241590) (← links)
- Voronoi diagrams with overlapping regions (Q2393120) (← 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)
- Districting for Arc Routing (Q2940070) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
