Approximation algorithms for deadline-TSP and vehicle routing with time-windows.
Nikhil BansalAvrim BlumShuchi ChawlaAdam MeyersonPublished in: STOC (2004)
Keyphrases
- approximation algorithms
- vehicle routing
- vehicle routing problem
- np hard
- traveling salesman problem
- routing problem
- column generation
- special case
- travel time
- ant colony optimization
- vehicle routing problems with time windows
- combinatorial optimization
- minimum cost
- logistics distribution
- optimal solution
- worst case
- resource constraints
- vertex cover
- production scheduling
- set cover
- integer programming
- scheduling problem
- np complete
- network design problem
- response time
- open shop
- metaheuristic
- optimization problems
- genetic algorithm
- combinatorial auctions
- linear programming
- approximation ratio
- randomized algorithms
- primal dual
- upper bound
- evolutionary algorithm
- constant factor
- polynomial time approximation
- search space
- neural network
- constant factor approximation
- linear program
- lower bound
- vehicle routing and scheduling