@techreport{TD:100396,
	att_abstract={{This paper presents a new approach to solve the NP-complete minimum
branch vertices problem (MBV) introduced by Gargano et al. (2002).
In spite of being a recently proposed problem in the network optimization
literature, there are some heuristics to solve it (Cerulli et al.,
2002). The main contribution of this paper consists in a new heuristic
based on the iter- ative refinement approach proposed by Deo and Kumar
(1997). The experimental results suggest that this approach is capable of
finding solutions that are better than the best known in the literature.
In this work, for instance, the proposed heuristic found better solutions
for 78% of the instances tested. The heuristic looks very promising for
the solution of problems related with constrained spanning trees.
}},
	att_authors={mr5626},
	att_categories={C_CCF.2, C_CCF.7, C_CCF.8},
	att_copyright={{Springer-Verlag}},
	att_copyright_notice={{The definitive version was published in  Lecture Notes in Computer Science. {{, Volume 6630}}{{, 2011-05-05}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Constrained spanning trees,  branch vertices,  iterative refinement},
	att_techdoc={true},
	att_techdoc_key={TD:100396},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100396_DS1_2011-02-16T16:40:26.770Z.pdf},
	author={Mauricio Resende and Diego M. Silva and Ricardo M.A. Silva and Geraldo R. Mateus and José Gonçalves and Paola Festa},
	institution={{Lecture Notes in Computer Science}},
	month={May},
	title={{An iterative refinement algorithm for the minimum branch vertices problem}},
	year=2011,
}