Halin graphs and the travelling salesman problem
- 275 Downloads
A Halin graphH=T∪C is obtained by embedding a treeT having no nodes of degree 2 in the plane, and then adding a cycleC to join the leaves ofT in such a way that the resulting graph is planar. These graphs are edge minimal 3-connected, hamiltonian, and in general have large numbers of hamilton cycles. We show that for arbitrary real edge costs the travelling salesman problem can be polynomially solved for such a graph, and we give an explicit linear description of the travelling salesman polytope (the convex hull of the incidence vectors of the hamilton cycles) for such a graph.
Key wordsTravelling Salesman Problem Polynomial Algorithm Integer Polytope Polyhedral Combinatorics Halin Graph Roofless Polyhedron Edge Cutset
Unable to display preview. Download preview PDF.
- G. Cornuéjols, D. Naddef and W.R. Pulleyblank, “The travelling salesman problem in graphs with 3-edge cutsets”, Discussion paper no. 8212, Centre for Operations Research and Econometrics (Louvain-la-Neuve 1982).Google Scholar
- J. Edmonds and E.L. Johnson “Matching: a well-solved class of integer programs”, in R.K. Guy et al., eds.,Combinatorial structures and their applications (Gordon and Breach, New York, 1970) pp. 89–92.Google Scholar
- R. Halin, “Studies on minimallyn-connected graphs”, in D.J.A. Welsh, ed.,Combinatorial mathematics, and its applications (Academic Press, New York 1971) pp. 129–136.Google Scholar
- W.R. Pulleyblank, “The matching rank of Halin graphs”, RR210, 1MAG, Université Scientifique et Médicale de Grenoble, France (1980).Google Scholar
- M. Syslo and A. Proskurowski, “On Halin graphs”, to appear inProceedings of the Tagow Conference dedicated to the memory of R. Kuratowski (1981).Google Scholar