A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
Aparna DasClaire MathieuPublished in: CoRR (2008)
Keyphrases
- polynomial time approximation
- vehicle routing
- np hard
- vehicle routing problem
- routing problem
- approximation algorithms
- error bounds
- logistics distribution
- travel time
- column generation
- vehicle routing problems with time windows
- minimum cost
- integer programming
- linear program
- worst case
- special case
- np complete
- bin packing
- optimal solution
- tabu search
- linear programming
- neural network
- metaheuristic
- particle swarm optimization
- optimization problems
- computational complexity
- video sequences