A sample approximation solution procedure for chance-constrained districting problems

Cites Work

Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
New models for commercial territory design
Towards a stochastic programming modeling framework for districting
Designing delivery districts for the vehicle routing problem with stochastic demands
A reactive GRASP for a commercial territory design problem with multiple balancing requirements
Solving a large scale districting problem: A case report
Optimal political districting
An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
A hybrid heuristic for the \(p\)-median problem
A tabu search heuristic and adaptive memory procedure for political districting
A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
A matheuristic algorithm for stochastic home health care planning
Political districting: from classical models to recent approaches
An optimization-based approach for the healthcare districting under uncertainty
Dividing a Territory Among Several Vehicles
Robust Partitioning for Stochastic Multivehicle Routing
A Sample Approximation Approach for Optimization with Probabilistic Constraints
The Capacitated and Economic Districting Problem
Optimal Districting and Territory Design
Approximation schemes for districting problems with probabilistic constraints

This page was built for publication: A sample approximation solution procedure for chance-constrained districting problems