Solving minimum-cost shared arborescence problems

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus

Document type :

Compte-rendu et recension critique d'ouvrage

DOI :

10.1016/j.ejor.2016.11.004

Title :

Solving minimum-cost shared arborescence problems

Author(s) :

Álvarez-Miranda, Eduardo [Auteur]
Universidad de Talca
Ljubić, Ivana [Auteur]
ESSEC Business School
Luipersbeck, Martin [Auteur]
Universität Wien = University of Vienna
Sinnl, Markus [Auteur]
Integrated Optimization with Complex Structure [INOCS]

Journal title :

European Journal of Operational Research

Pages :

887 - 901

Publisher :

Elsevier

Publication date :

2017-05

ISSN :

0377-2217

HAL domain(s) :

Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this problem, the goal is to find a minimum-cost subgraph, which is shared among multiple entities and each entity is able to establish ...
Show more >In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this problem, the goal is to find a minimum-cost subgraph, which is shared among multiple entities and each entity is able to establish a cost-efficient Steiner arborescence. The SStA has been recently used in the literature to establish shared functional modules in protein-protein interaction networks.We propose a cut-based formulation for the problem, and design two exact algorithmic approaches: one based on the separation of connectivity cut inequalities, and the other corresponding to a Benders decomposition of the former model. Both approaches are enhanced by various techniques, including (i) preprocessing, (ii) stabilized cut generation, (iii) primal heuristics, and (iv) cut management. These two algorithmic alternatives are computationally evaluated and compared with a previously proposed flow-based formulation. We illustrate the effectiveness of the algorithms on two types of instances derived from protein-protein interaction networks (available from the previous literature) and from telecommunication access networks.Show less >

Language :

Anglais

Popular science :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Solving minimum-cost shared arborescence problems BibTeX CSV Excel RIS

Solving minimum-cost shared arborescence problems

BibTeX

CSV

Excel

RIS