Pages that link to "Item:Q4661057"
From MaRDI portal
The following pages link to School redistricting: embedding GIS tools with integer programming (Q4661057):
Displaying 20 items.
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- A redistricting problem applied to meter reading in power distribution networks (Q336759) (← links)
- Towards a stochastic programming modeling framework for districting (Q827113) (← links)
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements (Q955609) (← links)
- Achieving full connectivity of sites in the multiperiod reserve network design problem (Q1652228) (← links)
- A GRASP-Tabu heuristic approach to territory design for pickup and delivery operations for large-scale instances (Q1992783) (← 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)
- Modularity maximization to design contiguous policy zones for pandemic response (Q2171547) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- A hierarchical location model for public facility planning (Q2456408) (← links)
- Optimizing location and size of rural schools in Chile (Q2867098) (← links)
- A deterministic linear optimization model for allocating schools to zones (Q3394075) (← links)
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems (Q3621930) (← links)
- Redistricting algorithms (Q5050043) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)
- How to know it is ``the one''? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization (Q6566828) (← links)
- A comparison between optimization tools to solve sectorization problem (Q6629015) (← links)