Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

SCIP-Jack – A solver for STP and variants with parallelization extensions

Please always quote using this URN: urn:nbn:de:0297-zib-60170
  • The Steiner tree problem in graphs is a classical problem that commonly arises in practical applications as one of many variants. While often a strong relationship between different Steiner tree problem variants can be observed, solution approaches employed so far have been prevalently problem-specific. In contrast, this paper introduces a general-purpose solver that can be used to solve both the classical Steiner tree problem and many of its variants without modification. This versatility is achieved by transforming various problem variants into a general form and solving them by using a state-of-the-art MIP-framework. The result is a high-performance solver that can be employed in massively parallel environments and is capable of solving previously unsolved instances.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Gerald GamrathORCiD, Thorsten KochORCiD, Stephen J. Maher, Daniel RehfeldtORCiD, Yuji ShinanoORCiD
Document Type:ZIB-Report
Tag:maximum-weight connected subgraph; prize-collecting Steiner tree
SCIP-Jack; Steiner tree problem; Steiner tree variants
CCS-Classification:D. Software
Date of first Publication:2016/08/16
Series (Serial Number):ZIB-Report (16-41)
Published in:Mathematical Programming Computation, Vol. 9 (2)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.