Pages that link to "Item:Q2892219"
From MaRDI portal
The following pages link to Approximation algorithms for VRP with stochastic demands (Q2892219):
Displaying 16 items.
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
- Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
- A decision framework for automatic guided vehicle routing problem with traffic congestions (Q2223261) (← links)
- A multi-period TSP with stochastic regular and urgent demands (Q2456410) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- Approximation Algorithms for Cumulative VRP with Stochastic Demands (Q2795944) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands (Q5130499) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- A two-stage stochastic location-routing problem for electric vehicles fast charging (Q6106597) (← links)
- The probabilistic uncapacitated open vehicle routing location problem (Q6179724) (← links)
