Traveling salesman path problems

Fumei Lam, Alantha Newman
2006 Mathematical programming  
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.
more » ... 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( √ n)-approximation algorithm for this problem. Mathematics Subject Classification (2000) 68Q25 · 68R10 · 90C05 · 90C27 Introduction The traveling salesman problem (TSP) is a well-studied problem in combinatorial optimization. The books [10, 15] provide a compendium of results and Alantha Newman was supported in part by NSF grant CCR0307536.
doi:10.1007/s10107-006-0046-8 fatcat:6wa5ktitcrbi3mlt5l7vkwfdcu