Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension.
Amariah BeckerPhilip N. KleinDavid SaulpicPublished in: ESA (2018)
Keyphrases
- vehicle routing
- approximation schemes
- approximation algorithms
- vehicle routing problem
- routing problem
- np hard
- travel time
- logistics distribution
- special case
- worst case
- tabu search
- vehicle routing problems with time windows
- traveling salesman problem
- scheduling problem
- column generation
- metaheuristic
- np complete
- vehicle routing and scheduling
- numerical methods
- lot sizing
- combinatorial optimization
- benchmark problems
- computational complexity
- integer programming
- shortest path
- lower bound
- knapsack problem
- image processing
- error rate
- constraint satisfaction problems
- particle swarm optimization
- data structure
- objective function