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

- Authors:

- Publication Date:

- Research Org.:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). Oak Ridge Leadership Computing Facility (OLCF)

- Sponsoring Org.:
- USDOE Office of Science (SC)

- OSTI Identifier:
- 1567539

- Resource Type:
- Journal Article

- Journal Name:
- Mathematical Programming Computation

- Additional Journal Information:
- Journal Volume: 9; Journal Issue: 2; Journal ID: ISSN 1867-2949

- Publisher:
- Springer

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 90C10; 90C27

### Citation Formats

```
Gamrath, Gerald, Koch, Thorsten, Maher, Stephen J., Rehfeldt, Daniel, and Shinano, Yuji.
```*SCIP-Jack—a solver for STP and variants with parallelization extensions*. United States: N. p., 2016.
Web. doi:10.1007/s12532-016-0114-x.

```
Gamrath, Gerald, Koch, Thorsten, Maher, Stephen J., Rehfeldt, Daniel, & Shinano, Yuji.
```*SCIP-Jack—a solver for STP and variants with parallelization extensions*. United States. doi:10.1007/s12532-016-0114-x.

```
Gamrath, Gerald, Koch, Thorsten, Maher, Stephen J., Rehfeldt, Daniel, and Shinano, Yuji. Fri .
"SCIP-Jack—a solver for STP and variants with parallelization extensions". United States. doi:10.1007/s12532-016-0114-x.
```

```
@article{osti_1567539,
```

title = {SCIP-Jack—a solver for STP and variants with parallelization extensions},

author = {Gamrath, Gerald and Koch, Thorsten and Maher, Stephen J. and Rehfeldt, Daniel and Shinano, Yuji},

abstractNote = {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.},

doi = {10.1007/s12532-016-0114-x},

journal = {Mathematical Programming Computation},

issn = {1867-2949},

number = 2,

volume = 9,

place = {United States},

year = {2016},

month = {12}

}

Works referenced in this record:

##
Phylogenetic analysis of multiprobe fluorescence in situ hybridization data from tumor cell populations

journal, June 2013

- Chowdhury, Salim Akhter; Shackney, Stanley E.; Heselmeyer-Haddad, Kerstin
- Bioinformatics, Vol. 29, Issue 13

##
Identifying functional modules in protein-protein interaction networks: an integrated exact approach

journal, June 2008

- Dittrich, M. T.; Klau, G. W.; Rosenwald, A.
- Bioinformatics, Vol. 24, Issue 13

##
Solving Steiner tree problems in graphs to optimality

journal, October 1998

- Koch, T.; Martin, A.
- Networks, Vol. 32, Issue 3

##
SCIP: solving constraint integer programs

journal, January 2009

- Achterberg, Tobias
- Mathematical Programming Computation, Vol. 1, Issue 1

##
An algorithm for the steiner problem in graphs

journal, April 1984

- Beasley, J. E.
- Networks, Vol. 14, Issue 1

##
A dual ascent approach for steiner tree problems on a directed graph

journal, October 1984

- Wong, Richard T.
- Mathematical Programming, Vol. 28, Issue 3

##
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

journal, August 2002

- Ribeiro, Celso C.; Uchoa, Eduardo; Werneck, Renato F.
- INFORMS Journal on Computing, Vol. 14, Issue 3

##
An SST-based algorithm for the steiner problem in graphs

journal, January 1989

- Beasley, J. E.
- Networks, Vol. 19, Issue 1

##
The Rectilinear Steiner Tree Problem is $NP$-Complete

journal, June 1977

- Garey, M. R.; Johnson, D. S.
- SIAM Journal on Applied Mathematics, Vol. 32, Issue 4

##
On Steiner’s Problem with Rectilinear Distance

journal, March 1966

- Hanan, M.
- SIAM Journal on Applied Mathematics, Vol. 14, Issue 2

##
On the Exact Location of Steiner Points in General Dimension

journal, February 1992

- Snyder, Timothy Law
- SIAM Journal on Computing, Vol. 21, Issue 1

##
Solving group Steiner problems as Steiner problems

journal, April 2004

- Duin, C. W.; Volgenant, A.; Voß, S.
- European Journal of Operational Research, Vol. 154, Issue 1

##
New Reduction Techniques for the Group Steiner Tree Problem

journal, January 2007

- Ferreira, Carlos Eduardo; de Oliveira Filho, Fernando M.
- SIAM Journal on Optimization, Vol. 17, Issue 4