242 search results - page 7 / 49 » Approximation Algorithms for Multi-Criteria Traveling Salesm... |
158
click to vote
NETWORKS
2010
14 years 10 months ago
2010
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
TOC
2008
14 years 11 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
APPROX
2010
Springer
15 years 1 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...
117
click to vote
ENDM
2010
14 years 11 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...
NETWORKS
1998
14 years 11 months ago
1998