A branch-and-cut algorithm for the soft-clustered vehicle-routing problem.

Katrin Heßler Stefan Irnich

Published in: Discret. Appl. Math. (2021)

Keyphrases

benchmark problems
dynamic programming
vehicle routing problem
computational complexity
np hard
combinatorial optimization
memetic algorithm
linear programming
optimization algorithm
knapsack problem
routing problem
information retrieval
search space
cost function
np complete