Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP
Year: 2018
Author: Daniel Rehfeldt, Thorsten Koch
Journal of Computational Mathematics, Vol. 36 (2018), Iss. 3 : pp. 459–468
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/jcm.1709-m2017-0002
Journal of Computational Mathematics, Vol. 36 (2018), Iss. 3 : pp. 459–468
Published online: 2018-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10
Keywords: Prize-collecting Steiner tree problem Maximum-weight connected subgraph problem Graph transformations Dual-ascent heuristics.