@conference {7cb959031f904987ac829f31e03274f6,
	title = {Computational comparison of algorithms for a generalization of the node-weighted Steiner tree and forest problems},
	booktitle = {Livro de Atas do XVI Congresso da Associa{\c c}{\~a}o Portuguesa de Investiga{\c c}{\~a}o Operacional (IO2013)},
	year = {2013},
	note = {<p>null ; Conference date: 01-01-2013</p>
},
	pages = {77{\textendash}87},
	abstract = {<p>Habitat fragmentation is a serious threat for the sustainability of species. Thus, the identification of effective linkages to connect valuable ecological units is an important issue in conservation biology. The design of effective linkages should take into account that areas which are adequately permeable for some species{\textquoteright} dispersal may act as obstructions for other species. The determination of minimum cost effective linkages is a generalization of both node-weighted Steiner tree and node-weighted Steiner forest problems. We compare the performance of different procedures for this problem using large real and simulated instances.</p>
},
	keywords = {Combinatorial optimization, Graphs, Heuristics, Minimum Steiner Trees},
	isbn = {978-972-745-153-1},
	author = {Cerdeira, {Jorge Orestes Lasbarr{\`e}res}}
}
