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

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

  • 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.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Gerald GamrathORCiD, Thorsten KochORCiD, Stephen J. Maher, Daniel RehfeldtORCiD, Yuji ShinanoORCiD
Document Type:Article
Parent Title (English):Mathematical Programming Computation
Volume:9
Issue:2
First Page:231
Last Page:296
Year of first publication:2017
Preprint:urn:nbn:de:0297-zib-60170
DOI:https://doi.org/10.1007/s12532-016-0114-x
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.