Home > Research > Publications & Outputs > SCIP-Jack - A solver for STP and variants with ...

Research

Electronic data

  • gamrath17

    Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s12532-016-0114-x

    Accepted author manuscript, 526 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

SCIP-Jack - A solver for STP and variants with parallelization extensions. / Gamrath, Gerald; Koch, Thorsten; Maher, Stephen et al.
In: Mathematical Programming Computation, Vol. 9, No. 2, 06.2017, p. 231-296.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Gamrath, G, Koch, T, Maher, S, Rehfeldt, D & Shinano, Y 2017, 'SCIP-Jack - A solver for STP and variants with parallelization extensions', Mathematical Programming Computation, vol. 9, no. 2, pp. 231-296. https://doi.org/10.1007/s12532-016-0114-x

APA

Gamrath, G., Koch, T., Maher, S., Rehfeldt, D., & Shinano, Y. (2017). SCIP-Jack - A solver for STP and variants with parallelization extensions. Mathematical Programming Computation, 9(2), 231-296. https://doi.org/10.1007/s12532-016-0114-x

Vancouver

Gamrath G, Koch T, Maher S, Rehfeldt D, Shinano Y. SCIP-Jack - A solver for STP and variants with parallelization extensions. Mathematical Programming Computation. 2017 Jun;9(2):231-296. Epub 2016 Dec 2. doi: 10.1007/s12532-016-0114-x

Author

Gamrath, Gerald ; Koch, Thorsten ; Maher, Stephen et al. / SCIP-Jack - A solver for STP and variants with parallelization extensions. In: Mathematical Programming Computation. 2017 ; Vol. 9, No. 2. pp. 231-296.

Bibtex

@article{db5af991163f48c9b3225b135ecfa0c4,
title = "SCIP-Jack - A solver for STP and variants with parallelization extensions",
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.",
author = "Gerald Gamrath and Thorsten Koch and Stephen Maher and Daniel Rehfeldt and Yuji Shinano",
note = "The final publication is available at Springer via http://dx.doi.org/10.1007/s12532-016-0114-x",
year = "2017",
month = jun,
doi = "10.1007/s12532-016-0114-x",
language = "English",
volume = "9",
pages = "231--296",
journal = "Mathematical Programming Computation",
issn = "1867-2949",
publisher = "Springer Verlag",
number = "2",

}

RIS

TY - JOUR

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

AU - Gamrath, Gerald

AU - Koch, Thorsten

AU - Maher, Stephen

AU - Rehfeldt, Daniel

AU - Shinano, Yuji

N1 - The final publication is available at Springer via http://dx.doi.org/10.1007/s12532-016-0114-x

PY - 2017/6

Y1 - 2017/6

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

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

U2 - 10.1007/s12532-016-0114-x

DO - 10.1007/s12532-016-0114-x

M3 - Journal article

VL - 9

SP - 231

EP - 296

JO - Mathematical Programming Computation

JF - Mathematical Programming Computation

SN - 1867-2949

IS - 2

ER -