Login / Signup
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints.
Norbert Ascheuer
Michael Jünger
Gerhard Reinelt
Published in:
Comput. Optim. Appl. (2000)
Keyphrases
</>
computational complexity
cost function
objective function
search space
dynamic programming
optimization algorithm
optimal solution
search algorithm
worst case
particle swarm optimization
single machine scheduling problem
upper bound
markov random field
parallel machines
series parallel
vertex cover