Login / Signup
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Armando Honorio Pereira
Geraldo Robson Mateus
Sebastián Alberto Urrutia
Published in:
Eur. J. Oper. Res. (2022)
Keyphrases
</>
dynamic programming
expectation maximization
objective function
computational complexity
search space
linear programming
particle swarm optimization
learning algorithm
worst case
randomly generated
optimal solution
cost function
np hard
probabilistic model
convergence rate
primal dual