A sample approximation solution procedure for chance-constrained districting problems
From MaRDI portal
Cites work
- A hybrid heuristic for the \(p\)-median problem
- 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
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A tabu search heuristic and adaptive memory procedure for political districting
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- An optimization-based approach for the healthcare districting under uncertainty
- Approximation schemes for districting problems with probabilistic constraints
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Dividing a territory among several vehicles
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
- New models for commercial territory design
- Optimal districting and territory design
- Optimal political districting
- Political districting: from classical models to recent approaches
- Robust partitioning for stochastic multivehicle routing
- Solving a large scale districting problem: A case report
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- The Capacitated and Economic Districting Problem
- Towards a stochastic programming modeling framework for districting
This page was built for publication: A sample approximation solution procedure for chance-constrained districting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068707)