Mathematical Programming

, Volume 113, Issue 1, pp 39–59

# Traveling salesman path problems

Open Access
FULL LENGTH PAPER

## Abstract

In the traveling salesman path problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objective is to find a minimum cost path from the source to destination visiting all cities exactly once. In this paper, we study polyhedral and combinatorial properties of a variant we call the traveling salesman walk problem, in which the objective is to find a minimum cost walk from the source to destination visiting all cities at least once. We first characterize traveling salesman walk perfect graphs, graphs for which the convex hull of incidence vectors of traveling salesman walks can be described by linear inequalities. We show these graphs have a description by way of forbidden minors and also characterize them constructively. We also address the asymmetric traveling salesman path problem (ATSPP) and give a factor $$O(\sqrt{n})$$-approximation algorithm for this problem.

### Mathematics Subject Classification (2000)

68Q25 68R10 90C05 90C27

### References

1. 1.
Anily S., Bramel J., Hertz A. (1999) A 5/3-approximation algorithm for the cluster traveling salesman tour and path problems. Oper. Res. 24, 29–35
2. 2.
Bläser, M. A new approximation algorithm for the asymmetric TSP with triangle inequality. In: Proceedings of the ACM-SIAM symposium on discrete algorithms, pp. 638–645, 2002Google Scholar
3. 3.
Christofides, N. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie Mellon University, 1976Google Scholar
4. 4.
Cornu’ejols G., Fonlupt J., Naddef D. (1985) The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33, 1–27
5. 5.
Fleischmann B. (1985) A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21 Google Scholar
6. 6.
Fonlupt J., Naddef D. (1992) The traveling salesman problem in graphs with some excluded minors. Math. Program. 53, 147–172
7. 7.
Frieze A., Galbiati G., Maffioli F. (1982) On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23–39
8. 8.
Gawrilow E., Joswig M. Polymake: a framework for analyzing convex polytopes, pp. 43–74, 2000Google Scholar
9. 9.
Goemans M.X. (1994) The Steiner tree polytope and related polyhedra. Math. Program. 63, 157–182
10. 10.
Gutin G., Punnen A. ed. (2002) The traveling salesman problem and its variations. Kluwer, Dordrecht
11. 11.
Guttmann-Beck N., Hassin R., Khuller S., Raghavachari B. (2000) Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica 28, 422–437
12. 12.
Hoogeveen J.A. (1991) Analysis of Christofides’ heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10, 291–295
13. 13.
Kaplan, H., Lewenstein, M., Shafir, N., Sviridenko, M. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. In: Proceedings of the IEEE Foundations on Computer Science, pp. 56–67, 2003Google Scholar
14. 14.
Lam, F. Traveling salesman path problems, Ph.D thesis, Massachusetts Institute of Technology, 2005Google Scholar
15. 15.
Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G, Shmoys D.B. (1985) The traveling salesman problem, a guided tour of combinatorial optimization. Wiley, New York
16. 16.
Naddef D., Rinaldi G. (1991) The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities. Math. Program. 51, 359–400
17. 17.
Naddef D., Rinaldi G. (1993) The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Math. Program. 58, 53–88
18. 18.
Schrijver A. (2003) Combinatorial optimization, polyhedra and efficiency, vols. A,B,C. Springer, Berlin Heidelberg New YorkGoogle Scholar
19. 19.