Pages that link to "Item:Q2482812"
From MaRDI portal
The following pages link to Local search algorithms for political districting (Q2482812):
Displayed 32 items.
- A redistricting problem applied to meter reading in power distribution networks (Q336759) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- New models for commercial territory design (Q411270) (← links)
- An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
- 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)
- Some remarks on the concept of proportionality (Q744682) (← links)
- Towards a stochastic programming modeling framework for districting (Q827113) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
- Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Multiobjective scatter search for a commercial territory design problem (Q1761773) (← links)
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application (Q2030544) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Modularity maximization to design contiguous policy zones for pandemic response (Q2171547) (← links)
- Goal programming approach for political districting in Santa Catarina state: Brazil (Q2178309) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- Mathematical political districting taking care of minority groups (Q2241590) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- A dual bounding scheme for a territory design problem (Q2257364) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
- Redistricting algorithms (Q5050043) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Redistricting optimization with recombination: a local search case study (Q6068697) (← links)
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment (Q6088170) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)