Pages that link to "Item:Q2393445"

The following pages link to Political districting: from classical models to recent approaches (Q2393445):

Displaying 32 items.

• An optimization model for aggregation of prescribed burn units (Q286203) (← links)
• Towards a stochastic programming modeling framework for districting (Q827113) (← 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)
• An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
• A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization (Q2026965) (← 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)
• Territory design for the multi-period vehicle routing problem with time windows (Q2147160) (← links)
• Modularity maximization to design contiguous policy zones for pandemic response (Q2171547) (← 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)
• 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)
• A discrete districting plan (Q2303654) (← links)
• A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas (Q2629905) (← links)
• An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
• Simulation models to support the preliminary electoral results program for the Mexican electoral institute (Q2675716) (← links)
• Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
• A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
• Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
• Redistricting optimization with recombination: a local search case study (Q6068697) (← links)
• A sample approximation solution procedure for chance-constrained districting problems (Q6068707) (← links)
• The min-Knapsack problem with compactness constraints and applications in statistics (Q6069243) (← links)
• Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment (Q6079874) (← links)
• Reconfiguration of connected graph partitions (Q6093138) (← links)
• Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)
• An Exact Solution Method for the Political Districting Problem (Q6135729) (← 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)