A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.
Claire MathieuHang ZhouPublished in: ICALP (2023)
Keyphrases
- vehicle routing
- vehicle routing problem
- routing problem
- travel time
- logistics distribution
- lower bound
- inventory management
- tabu search
- vehicle routing problems with time windows
- np hard
- metaheuristic
- column generation
- benchmark problems
- approximation algorithms
- upper bound
- routing algorithm
- traveling salesman problem
- vehicle routing and scheduling
- lot sizing
- cost function
- worst case
- simulated annealing
- data structure
- np complete
- knapsack problem
- search strategies
- combinatorial optimization