Approximation algorithms for VRP with stochastic demands
From MaRDI portal
Recommendations
Cited in
(21)- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- Improved approximation algorithms for cumulative VRP with stochastic demands
- A decision framework for automatic guided vehicle routing problem with traffic congestions
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
- A multi-period TSP with stochastic regular and urgent demands
- Approximation algorithms for the a priori traveling repairman
- Approximation algorithms for a virtual machine allocation problem with finite types
- Approximation algorithms for cumulative VRP with stochastic demands
- Capacitated vehicle routing with nonuniform speeds
- Stochastic vehicle routing with recourse
- Capacitated vehicle routing with non-uniform speeds
- On risk-averse maximum weighted subgraph problems
- scientific article; zbMATH DE number 591242 (Why is no real title available?)
- Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
- A two-stage stochastic location-routing problem for electric vehicles fast charging
- The probabilistic uncapacitated open vehicle routing location problem
- Approximation algorithms for cumulative vehicle routing with stochastic demands
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
This page was built for publication: Approximation algorithms for VRP with stochastic demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892219)
