Homepage Inria website

Section: New Software and Platforms


A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems

Keywords: Mathematical Optimization - Systems Biology

Functional Description: Variants of the Steiner tree problem appear in a broad range of diverse applications, ranging from infrastructure network design to the analysis of biological networks and pattern recognition. In this software, we provide a branch-and-bound (B&B) framework for solving the asymmetric prize-collecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS) and the node-weighted Steiner tree problem (NWSTP).