A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.
Aparna DasClaire MathieuPublished in: SODA (2010)
Keyphrases
- polynomial time approximation
- vehicle routing
- np hard
- vehicle routing problem
- routing problem
- approximation algorithms
- column generation
- logistics distribution
- error bounds
- np complete
- travel time
- integer programming
- vehicle routing problems with time windows
- scheduling problem
- linear programming
- special case
- minimum cost
- vehicle routing and scheduling
- optimal solution
- lower bound
- metaheuristic
- bin packing
- worst case
- computational complexity
- routing algorithm
- benchmark problems
- linear program
- tabu search
- constraint satisfaction problems
- approximation guarantees
- genetic algorithm