A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees.
Amariah BeckerPublished in: APPROX-RANDOM (2018)
Keyphrases
- vehicle routing
- vehicle routing problem
- routing problem
- travel time
- inventory management
- metaheuristic
- logistics distribution
- np hard
- lower bound
- vehicle routing and scheduling
- column generation
- approximation algorithms
- vehicle routing problems with time windows
- worst case
- upper bound
- particle swarm optimization
- knapsack problem
- multi item
- tabu search
- shortest path
- benchmark problems
- lot sizing
- global optimization
- combinatorial optimization
- np complete
- genetic algorithm
- routing algorithm
- neural network
- traveling salesman problem
- computer vision