<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cerdeira, {Jorge Orestes Lasbarrères}</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computational comparison of algorithms for a generalization of the node-weighted Steiner tree and forest problems</style></title><secondary-title><style face="normal" font="default" size="100%">Livro de Atas do XVI Congresso da Associa{\c c}ão Portuguesa de Investiga{\c c}ão Operacional (IO2013)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Combinatorial optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Graphs</style></keyword><keyword><style  face="normal" font="default" size="100%">Heuristics</style></keyword><keyword><style  face="normal" font="default" size="100%">Minimum Steiner Trees</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><pages><style face="normal" font="default" size="100%">77–87</style></pages><isbn><style face="normal" font="default" size="100%">978-972-745-153-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Habitat fragmentation is a serious threat for the sustainability of species. Thus, the identiﬁcation of eﬀective linkages to connect valuable ecological units is an important issue in conservation biology. The design of eﬀective 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 eﬀective linkages is a generalization of both node-weighted Steiner tree and node-weighted Steiner forest problems. We compare the performance of diﬀerent procedures for this problem using large real and simulated instances.&lt;/p&gt;
</style></abstract><notes><style face="normal" font="default" size="100%">&lt;p&gt;null ; Conference date: 01-01-2013&lt;/p&gt;
</style></notes></record></records></xml>