IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-55240-4_10.html
   My bibliography  Save this book chapter

SCIP-Jack: An Exact High Performance Solver for Steiner Tree Problems in Graphs and Related Problems

In: Modeling, Simulation and Optimization of Complex Processes HPSC 2018

Author

Listed:
  • Daniel Rehfeldt

    (TU Berlin)

  • Yuji Shinano

    (Zuse Institute Berlin)

  • Thorsten Koch

    (TU Berlin
    Zuse Institute Berlin)

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.

Suggested Citation

  • Daniel Rehfeldt & Yuji Shinano & Thorsten Koch, 2021. "SCIP-Jack: An Exact High Performance Solver for Steiner Tree Problems in Graphs and Related Problems," Springer Books, in: Hans Georg Bock & Willi Jäger & Ekaterina Kostina & Hoang Xuan Phu (ed.), Modeling, Simulation and Optimization of Complex Processes HPSC 2018, pages 201-223, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-55240-4_10
    DOI: 10.1007/978-3-030-55240-4_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-55240-4_10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.