Technical Note - Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands.

Luca Bertazzi Nicola Secomandi

Published in: Oper. Res. (2020)

Keyphrases

worst case
vehicle routing problem with stochastic demands
np hard
error bounds
approximation algorithms
average case
upper bound
lower bound
neural network
greedy algorithm
data mining
metadata
learning environment
support vector
dynamic programming