SCIP-Jack: An Exact High Performance Solver for Steiner Tree Problems in Graphs and Related Problems
Daniel Rehfeldt (),
Yuji Shinano () and
Thorsten Koch ()
Additional contact information
Daniel Rehfeldt: TU Berlin
Yuji Shinano: Zuse Institute Berlin
Thorsten Koch: TU Berlin
A chapter in Modeling, Simulation and Optimization of Complex Processes HPSC 2018, 2021, pp 201-223 from Springer
Abstract:
Abstract The Steiner tree problem in graphs is one of the classic combinatorial optimization problems. Furthermore, many related problems, such as the rectilinear Steiner tree problem or the maximum-weight connected subgraph problem, have been described in the literature—with a wide range of practical applications. To embrace this wealth of problem classes, the solver SCIP-Jack has been developed as an exact framework for classic Steiner tree and 11 related problems. Moreover, the solver comes with both shared- and distributed memory extensions by means of the UG framework. Besides its versatility, SCIP-Jack is highly competitive for most of the 12 problem classes it can solve, as for instance demonstrated by its top ranking in the recent PACE 2018 Challenge. This article describes the current state of SCIP-Jack and provides up-to-date computational results, including several instances that can now be solved for the first time to optimality.
Date: 2021
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-55240-4_10
Ordering information: This item can be ordered from
http://www.springer.com/9783030552404
DOI: 10.1007/978-3-030-55240-4_10
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().