Solving minimum-cost shared arborescence problems

Eduardo Álvarez-Miranda 1 Ivana Ljubić 2 Martin Luipersbeck 3 Markus Sinnl 4
4 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : 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.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2017, 258 (3), pp.887 - 901. 〈10.1016/j.ejor.2016.11.004〉
Liste complète des métadonnées
Contributeur : Markus Sinnl <>
Soumis le : lundi 18 décembre 2017 - 11:14:41
Dernière modification le : jeudi 18 janvier 2018 - 01:02:48




Eduardo Álvarez-Miranda, Ivana Ljubić, Martin Luipersbeck, Markus Sinnl. Solving minimum-cost shared arborescence problems. European Journal of Operational Research, Elsevier, 2017, 258 (3), pp.887 - 901. 〈10.1016/j.ejor.2016.11.004〉. 〈hal-01666315〉



Consultations de la notice