Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem

Rehfeldt, Daniel and Koch, Thorsten and Maher, Stephen (2019) Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem. Networks, 73 (2). pp. 206-233. ISSN 0028-3045

[img]
Preview
PDF (PcMwReductions_Preprint)
PcMwReductions_Preprint.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (580kB)

Abstract

The concept of reduction has frequently distinguished itself as a pivotal ingredient of exact solving approaches for the Steiner tree problem in graphs. In this article we broaden the focus and consider reduction techniques for three Steiner problem variants that have been extensively discussed in the literature and entail various practical applications: The prize‐collecting Steiner tree problem, the rooted prize‐collecting Steiner tree problem and the maximum‐weight connected subgraph problem. By introducing and subsequently deploying numerous new reduction methods, we are able to drastically decrease the size of a large number of benchmark instances, already solving more than 90% of them to optimality. Furthermore, we demonstrate the impact of these techniques on exact solving, using the example of the state‐of‐the‐art Steiner problem solver SCIP‐Jack.

Item Type:
Journal Article
Journal or Publication Title:
Networks
Additional Information:
This is the peer reviewed version of the following article: Rehfeldt D, Koch T, Maher SJ. Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem. Networks. 2018;1–28. https://doi.org/10.1002/net.21857 which has been published in final form at https://onlinelibrary.wiley.com/doi/10.1002/net.21857 This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1710
Subjects:
ID Code:
129080
Deposited By:
Deposited On:
21 Nov 2018 11:40
Refereed?:
Yes
Published?:
Published
Last Modified:
20 Sep 2020 05:14