Computational comparison of algorithms for a generalization of the node-weighted Steiner tree and forest problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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’ 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.
Original languageUnknown
Title of host publicationLivro de Atas do XVI Congresso da Associação Portuguesa de Investigação Operacional (IO2013)
Pages77-87
Publication statusPublished - 1 Jan 2013
EventIO2013: XVI Congresso da Associação Portuguesa de Investigação Operacional -
Duration: 1 Jan 2013 → …

Conference

ConferenceIO2013: XVI Congresso da Associação Portuguesa de Investigação Operacional
Period1/01/13 → …

Cite this