Approximation Algorithms for Cumulative VRP with Stochastic Demands.
Daya Ram GaurApurva MudgalRishi Ranjan SinghPublished in: CALDAM (2016)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- vehicle routing problem
- worst case
- vertex cover
- minimum cost
- facility location problem
- constant factor
- network design problem
- open shop
- routing problem
- approximation ratio
- disjoint paths
- precedence constraints
- primal dual
- np hardness
- randomized algorithms
- exact algorithms
- combinatorial auctions
- polynomial time approximation
- partial order
- greedy algorithm
- ant colony optimization
- scheduling problem
- dynamic programming
- learning algorithm