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 languageEnglish
Title of host publicationOperational Research
EditorsJP Almeida, JF Oliveira, AA Pinto
Place of PublicationCham
PublisherSpringer International Publishing AG
Pages67-83
Number of pages17
ISBN (Electronic)978-3-319-20328-7
ISBN (Print)978-3-319-20327-0
DOIs
Publication statusPublished - 2015
Event16th National Conference of the APDIO - Braganca, Portugal
Duration: 3 Jun 20135 Jun 2013

Publication series

NameCIM Series in Mathematical Sciences
PublisherSpringer International Publishing AG
Volume4
ISSN (Print)2364-950X

Conference

Conference16th National Conference of the APDIO
CountryPortugal
CityBraganca
Period3/06/135/06/13

Keywords

  • CONNECTIVITY
  • HABITATS
  • GRAPHS
  • Operations Research & Management Science
  • Materials Science
  • Mathematics, Applied

Cite this