Title of article
The competitive salesman problem on a network: a worst-case approach
Author/Authors
Igor Averbakh، نويسنده , , Vasilij Lebedev، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 2006
Pages
10
From page
165
To page
174
Keywords
Traveling Salesman , Polynomial algorithm , NP-hardness
Journal title
Operations Research Letters
Serial Year
2006
Journal title
Operations Research Letters
Record number
137670
Link To Document