CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

A note on relatives to the Held and Karp 1-tree problem

by: Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson
Operations Research Letters, Vol. 34, No. 3. (May 2006), pp. 275-282, doi:10.1016/j.orl.2005.04.010  Key: citeulike:11896658

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

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.


afonso's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.