A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.
Claire MathieuHang ZhouPublished in: CoRR (2022)
Keyphrases
- vehicle routing
- vehicle routing problem
- routing problem
- logistics distribution
- travel time
- column generation
- inventory management
- metaheuristic
- np hard
- tabu search
- lower bound
- benchmark problems
- vehicle routing problems with time windows
- upper bound
- vehicle routing and scheduling
- worst case
- multi item
- traveling salesman problem
- combinatorial optimization
- shortest path
- optimal solution
- neural network
- particle swarm optimization
- linear programming
- dynamic programming