Name
Abstract | ||
|---|---|---|
This paper introduces a new notion related to the traveling salesperson problem (TSP)-the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal values of the nodes of I divided by the length of the optimal TSP tour on I, where the marginal value of a node i is an element of I is the difference between the length of the optimal tour on I and the length of the optimal tour on I\i. We consider the problem of establishing exact upper and lower bounds on the TSP ratio. To our knowledge, this problem has not been studied previously.We present a number of cases for which the ratio is never greater than 1. We establish a tight upper bound of 2 on the TSP ratio of any metric TSP. For the TSP on six nodes, we determine the maximum ratio of 1.5 in general, 1.2 for the case of metric TSP, and 10/9 for the geometric TSP in the L-1 metric. We also compute the TSP ratio experimentally for a large number of random TSP instances on small number of points. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1142/S0218195906002063 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
the traveling salesperson problem, mixed integer programming, cost allocation | Journal | 16 |
Issue | ISSN | Citations |
4 | 0218-1959 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moshe Dror | 1 | 574 | 64.77 |
| Yusin Lee | 2 | 163 | 9.57 |
| James B. Orlin | 3 | 2812 | 319.77 |
| Valentin Polishchuk | 4 | 252 | 34.51 |