SCIP-Jack - A solver for STP and variants with parallelization extensions
Please always quote using this URN: urn:nbn:de:0297-zib-54648
- 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 is achieved by transforming various problem variants into a general form and solving them 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.
Author: | Gerald GamrathORCiD, Thorsten KochORCiD, Stephen J. Maher, Daniel RehfeldtORCiD, Yuji ShinanoORCiD |
---|---|
Document Type: | ZIB-Report |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming |
Date of first Publication: | 2015/04/24 |
Series (Serial Number): | ZIB-Report (15-27) |
ISSN: | 1438-0064 |
Notes: | A revised version is provided here: http://nbn-resolving.de/urn:nbn:de:0297-zib-60170. |
Preprint: | urn:nbn:de:0297-zib-54648 |