Title of article :
The competitive salesman problem on a network: a worst-case approach
Author/Authors :
Igor Averbakh، نويسنده , , Vasilij Lebedev، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2006
Keywords :
Traveling Salesman , Polynomial algorithm , NP-hardness
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
