A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees.
Amariah BeckerPublished in: CoRR (2018)
Keyphrases
- vehicle routing
- vehicle routing problem
- routing problem
- travel time
- logistics distribution
- np hard
- vehicle routing problems with time windows
- lower bound
- metaheuristic
- approximation algorithms
- column generation
- inventory management
- worst case
- upper bound
- vehicle routing and scheduling
- tabu search
- combinatorial optimization
- particle swarm optimization
- shortest path
- benchmark problems
- traveling salesman problem
- lot sizing
- knapsack problem
- traffic flow
- neural network
- moving objects
- optimal solution