Return to Question

I am looking for a description of the linear time algorithm for the TSP in Halin graphs, that was given in

"G. Cornuejols, D. Naddef, and W.R. Pulleyblank. Halin graphs and the travelling salesman problem. Mathematical Programming, 26:287–294, 1983."

Unfortunately that article isn't freely accessible online and if would a great help for me, if anyone could provide a (link to a) description of that algorithm.

I need that algorithm for checking a new TSP heuristic, that would be based on Halin graphs.

I am looking for a description of the linear time algorithm for the TSP in Halin graphs, that was given in

"G. Cornuejols, D. Naddef, and W.R. Pulleyblank. Halin graphs and the travelling salesman problem. Mathematical Programming, 26:287–294, 1983."

Unfortunately that article isn't freely accessible online and if would a great help for me, if anyone could provide a (link to a) description of that algorithm.

I need that algorithm for checking a new TSP heuristic, that would be based on Halin graphs.