| Article ID: | iaor20062882 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 3 |
| Start Page Number: | 275 |
| End Page Number: | 282 |
| Publication Date: | May 2006 |
| Journal: | Operations Research Letters |
| Authors: | Larsson Torbjrn, Gthe-Lundgren Maud, Westerlund Andreas |
| Keywords: | programming: travelling salesman |
We study a class of graph problems which includes as special cases the Held and Karp 1-tree problem, and the minimum spanning tree problem with one degree constraint studied by Glover and Klingman. For another special case, we note a mistake in a paper by Ramesh, Yoon and Karwan.