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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
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
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, 2002
Christofides, N. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie Mellon University, 1976
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
Fleischmann B. (1985) A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21
Fonlupt J., Naddef D. (1992) The traveling salesman problem in graphs with some excluded minors. Math. Program. 53, 147–172
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
Gawrilow E., Joswig M. Polymake: a framework for analyzing convex polytopes, pp. 43–74, 2000
Goemans M.X. (1994) The Steiner tree polytope and related polyhedra. Math. Program. 63, 157–182
Gutin G., Punnen A. ed. (2002) The traveling salesman problem and its variations. Kluwer, Dordrecht
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
Hoogeveen J.A. (1991) Analysis of Christofides’ heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10, 291–295
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, 2003
Lam, F. Traveling salesman path problems, Ph.D thesis, Massachusetts Institute of Technology, 2005
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
Naddef D., Rinaldi G. (1991) The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities. Math. Program. 51, 359–400
Naddef D., Rinaldi G. (1993) The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Math. Program. 58, 53–88
Schrijver A. (2003) Combinatorial optimization, polyhedra and efficiency, vols. A,B,C. Springer, Berlin Heidelberg New York
Vempala, S. Personal communication
Author information
Authors and Affiliations
Corresponding author
Additional information
Alantha Newman was supported in part by NSF grant CCR0307536.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.