School redistricting: embedding GIS tools with integer programming
From MaRDI portal
Recommendations
- Computational geometric approaches to equitable districting: a survey
- A deterministic linear optimization model for allocating schools to zones
- Redistricting algorithms
- Redistricting optimization with recombination: a local search case study
- Solving a large scale districting problem: A case report
- Mathematical programming formulations for practical political districting
- A new integer linear programming formulation for the problem of political districting
Cited in
(25)- Achieving full connectivity of sites in the multiperiod reserve network design problem
- A GRASP-Tabu heuristic approach to territory design for pickup and delivery operations for large-scale instances
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- Modularity maximization to design contiguous policy zones for pandemic response
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- A hierarchical location model for public facility planning
- Optimizing location and size of rural schools in Chile
- A multi-criteria police districting problem for the efficient and effective design of patrol sector
- A redistricting problem applied to meter reading in power distribution networks
- A deterministic linear optimization model for allocating schools to zones
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- School location methodology in urban areas of developing countries
- Redistricting algorithms
- Imposing contiguity constraints in political districting models
- The Capacitated and Economic Districting Problem
- Approximation schemes for districting problems with probabilistic constraints
- How to know it is ``the one? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization
- A comparison between optimization tools to solve sectorization problem
- A survey of some operations research and data sciences applications developed in the last 20 years at argentinian and chilean universities
- Comparing voting districts with uncertain data envelopment analysis
- A multi-criteria districting approach with a lexicographic compactness metric: an application to the Chilean postal service
- An efficient probability-based VNS algorithm for delivery territory design
- Towards a stochastic programming modeling framework for districting
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
This page was built for publication: School redistricting: embedding GIS tools with integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661057)
