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

Gamrath, Gerald and Koch, Thorsten and Maher, Stephen and Rehfeldt, Daniel and Shinano, Yuji (2017) SCIP-Jack - A solver for STP and variants with parallelization extensions. Mathematical Programming Computation, 9 (2). pp. 231-296. ISSN 1867-2949

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

Download (538kB)

Abstract

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.

Item Type:
Journal Article
Journal or Publication Title:
Mathematical Programming Computation
Additional Information:
The final publication is available at Springer via http://dx.doi.org/10.1007/s12532-016-0114-x
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1712
Subjects:
ID Code:
127117
Deposited By:
Deposited On:
04 Sep 2018 12:42
Refereed?:
Yes
Published?:
Published
Last Modified:
20 Sep 2020 05:00