@Article{JCM-36-3,
author = {Rehfeldt, Daniel and Thorsten, Koch},
title = {Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP},
journal = {Journal of Computational Mathematics},
year = {2018},
volume = {36},
number = {3},
pages = {459--468},
abstract = {<p style="text-align: justify;">Transformations of Steiner tree problem variants have been frequently discussed in the
literature. Besides allowing to easily transfer complexity results, they constitute a central
pillar of exact state-of-the-art solvers for well-known variants such as the Steiner tree
problem in graphs. In this article transformations for both the prize-collecting Steiner tree
problem and the maximum-weight connected subgraph problem to the Steiner arborescence
problem are introduced for the first time. Furthermore, the considerable implications for
practical solving approaches will be demonstrated, including the computation of strong
upper and lower bounds.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1709-m2017-0002},
url = {https://global-sci.com/article/84478/transformations-for-the-prize-collecting-steiner-tree-problem-and-the-maximum-weight-connected-subgraph-problem-to-sap}
}