Login / Signup
A branch-and-cut algorithm for an assembly routing problem.
Masoud Chitsaz
Jean-François Cordeau
Raf Jans
Published in:
Eur. J. Oper. Res. (2020)
Keyphrases
</>
routing problem
cost function
search space
dynamic programming
optimal solution
computational complexity
benchmark problems
data structure
optimization algorithm
combinatorial optimization
standard deviation
vehicle routing problem