272 search results - page 6 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
127
Voted
TOC
2008
15 years 3 months ago
2008
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
130
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
149
click to vote
ENDM
2010
15 years 3 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
150
Voted
ICICIC
2006
IEEE
15 years 9 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
122
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...