Traveling salesman path problems
Massachusetts Institute of Technology. Dept. of Mathematics.
Michael X. Goemans.
MetadataShow full item record
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. The problem is a generalization of the Traveling Salesman Problem with many important applications. In this thesis, we study polyhedral and combinatorial properties of a variant we call the Traveling Salesman Walk Problem, in which the minimum cost walk from the source to destination visits all cities at least once. Using the approach of linear programming, we study properties of the polyhedron corresponding to a linear programming relaxation of the traveling salesman walk problem. Our results relate the structure of the underlying graph of the problem instance with polyhedral properties of the corresponding fractional walk polyhedron. 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.(cont.) We extend these results to relate the underlying graph structure to the integrality gap of the corresponding fractional walk polyhedron. We present several graph operations which preserve integrality gap; these operations allow us to find the integrality gap of graphs built from smaller bricks, whose integrality gaps can be found by computational or other methods.
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.Includes bibliographical references (p. 153-155).
DepartmentMassachusetts Institute of Technology. Dept. of Mathematics.
Massachusetts Institute of Technology