A note on relatives to the Held and Karp 1-tree problem
2006 (English)In: Operations Research Letters, ISSN 0167-6377, Vol. 34, no 3, 275-282 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2006. Vol. 34, no 3, 275-282 p.
IdentifiersURN: urn:nbn:se:liu:diva-36273DOI: 10.1016/j.orl.2005.04.010Local ID: 30783OAI: oai:DiVA.org:liu-36273DiVA: diva2:257121