@techreport{TD:100831,
	att_abstract={{This paper presents a new edge-swap heuristic for generating spanning
trees with a minimum number of branch vertices, i.e. vertices of degree
greater than two.  This problem was introduced in Gargano et al. (2002)
and has been called the minimum branch vertices (MBV) problem by Cerulli
et al. (2009).  The heuristic starts with a random spanning tree and
iteratively reduces the number of branch vertices by swapping tree edges
with edges not currently in the tree.  It can be easily implemented as a
multi-start heuristic.  We report on extensive computational experiments
comparing single-start and multi-start variants on our heuristic with
other heuristics previously proposed in the literature.}},
	att_authors={mr5626},
	att_categories={C_CCF.7, C_CCF.8},
	att_copyright={{Springer}},
	att_copyright_notice={{will be published by Springer in the journal "Optimziation Letters" }},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Constrained spanning trees, branch vertices, minimum branch vertices problem, heuristic, multi-start heuristic, edge swapping},
	att_techdoc={true},
	att_techdoc_key={TD:100831},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100831_DS1_2012-03-20T21:32:53.653Z.pdf},
	author={Mauricio Resende and Ricardo M. A. Silva, Fed, U, of Pernambuco and Diego M. Silva, Fed. U. of Lavras and Geraldo R. Mateus, Fed. U. of Minas Gerais and José F. Gonçalves, U. of Porto and Paola Festa, U. of Napoli},
	institution={{Optimization Letters}},
	month={June},
	title={{An edge-swap heuristic for generating spanning trees with minimum number of branch vertices}},
	year=2013,
}