Title of article :
A note on the complexity of the asymmetric traveling salesman problem
Author/Authors :
Weixiong Zhang، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1997
Keywords :
Traveling salesman problem , Branch-and-bound , average-case complexity , combinatorial optimization
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
