The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time.
Adam N. LetchfordJuan José Salazar GonzálezPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- worst case
- upper bound
- lower bound
- special case
- memetic algorithm
- approximation algorithms
- ant colony optimization
- vehicle routing problem
- upper and lower bounds
- metaheuristic
- finite automata
- confidence bounds
- low degree
- lower and upper bounds
- np hardness
- np hard
- simulated annealing
- capacity constraints
- winnow algorithm
- randomized algorithm
- constant factor
- variance reduction
- vc dimension
- data sets
- routing problem
- search space