SCIP-Jack—a solver for STP and variants with parallelization extensions
Gamrath, G; Koch, T; Maher, SJ; et al.Rehfeldt, D; Shinano, Y
Date: 2 December 2016
Journal
Mathematical Programming Computation
Publisher
Springer Verlag
Publisher DOI
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 problemspecific. In contrast, this paper introduces ...
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 problemspecific. 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-ofthe-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.
Mathematics and Statistics
Faculty of Environment, Science and Economy
Item views 0
Full item downloads 0