Journal
MATHEMATICAL PROGRAMMING COMPUTATION
Volume 9, Issue 2, Pages 231-296Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s12532-016-0114-x
Keywords
-
Categories
Funding
- BMBF Research Campus Modal SynLab
- Google Faculty Research Award
Ask authors/readers for more resources
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
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available