Improving the approximation ratio for capacitated vehicle routing.
Jannis BlauthVera TraubJens VygenPublished in: Math. Program. (2023)
Keyphrases
- vehicle routing
- approximation ratio
- vehicle routing problem
- np hard
- routing problem
- approximation algorithms
- travel time
- logistics distribution
- column generation
- metaheuristic
- special case
- inventory management
- vehicle routing problems with time windows
- minimum cost
- search algorithm
- integer programming
- approximately optimal
- benchmark problems
- greedy algorithm
- lower bound
- traveling salesman problem
- np complete
- scheduling problem
- knapsack problem
- tabu search
- optimal solution
- search strategies
- computational complexity
- branch and bound
- greedy algorithms
- approximation guarantees