Approximation schemes for districting problems with probabilistic constraints
From MaRDI portal
Recommendations
Cites work
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design
- 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 multi-criteria police districting problem for the efficient and effective design of patrol sector
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment
- A new integer linear programming formulation for the problem of political districting
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A redistricting problem applied to meter reading in power distribution networks
- A review of districting problems in health care
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A stochastic programming approach for supply chain network design under uncertainty
- 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
- Chance Constrained Programming with Joint Constraints
- Chance-constrained programming
- Convex Approximations of Chance Constrained Programs
- Designing ambulance service districts under uncertainty
- Districting for arc routing
- Dividing a territory among several vehicles
- Heuristic methods for the sectoring arc routing problem
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
- New models for commercial territory design
- On safe tractable approximations of chance constraints
- Optimal districting and territory design
- Political districting: from classical models to recent approaches
- Sample average approximation method for chance constrained programming: Theory and applications
- School redistricting: embedding GIS tools with integer programming
- The sample average approximation method for stochastic discrete optimization
- Towards a stochastic programming modeling framework for districting
Cited in
(2)
This page was built for publication: Approximation schemes for districting problems with probabilistic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106979)
