Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • Treffer 11 von 19
Zurück zur Trefferliste

SCIP-Jack – A solver for STP and variants with parallelization extensions

Zitieren Sie bitte immer diese URN: urn:nbn:de:0297-zib-60170
  • 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.

Volltext Dateien herunterladen

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Gerald GamrathORCiD, Thorsten KochORCiD, Stephen J. Maher, Daniel RehfeldtORCiD, Yuji ShinanoORCiD
Dokumentart:ZIB-Report
Freies Schlagwort / Tag:maximum-weight connected subgraph; prize-collecting Steiner tree
SCIP-Jack; Steiner tree problem; Steiner tree variants
MSC-Klassifikation:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
CCS-Klassifikation:D. Software
Datum der Erstveröffentlichung:16.08.2016
Schriftenreihe (Bandnummer):ZIB-Report (16-41)
ISSN:1438-0064
Verlagspublikation:Mathematical Programming Computation, Vol. 9 (2)
DOI:https://doi.org/10.1007/s12532-016-0114-x
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.