Homepage Inria website

Section: New Software and Platforms


A Relax-and-Cut Algorithm for Maximum Weight Connected Subgraph Problems

Keywords: Mathematical Optimization - Systems Biology

Functional Description: Finding maximum weight connected subgraphs within networks is a fundamental combinatorial optimization problem both from a theoretical and a practical standpoint. One of the most prominent applications of this problem appears in Systems Biology and it corresponds to the detection of active subnetworks within gene interaction networks. The software is a framework to solve the model by means of Relax-and-Cut, i.e., Lagrangian relaxation combined with constraint generation.