Login / Signup
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows.
André Langevin
Martin Desrochers
Jacques Desrosiers
Sylvie Gélinas
François Soumis
Published in:
Networks (1993)
Keyphrases
</>
traveling salesman
traveling salesman problem
scheduling problem
lower bound
np complete
decision trees
lin kernighan