|
View: |
Part 1: Document Description
|
|
Citation |
|
|---|---|
|
Title: |
Triangular Grid Instances for the Euclidean Steiner Tree Problem |
|
Identification Number: |
doi:10.60507/FK2/XLGFI4 |
|
Distributor: |
bonndata |
|
Date of Distribution: |
2024-05-24 |
|
Version: |
1 |
|
Bibliographic Citation: |
Hougardy, Stefan, 2024, "Triangular Grid Instances for the Euclidean Steiner Tree Problem", https://doi.org/10.60507/FK2/XLGFI4, bonndata, V1 |
|
Citation |
|
|
Title: |
Triangular Grid Instances for the Euclidean Steiner Tree Problem |
|
Identification Number: |
doi:10.60507/FK2/XLGFI4 |
|
Authoring Entity: |
Hougardy, Stefan (University of Bonn) |
|
Distributor: |
bonndata |
|
Access Authority: |
Hougardy, Stefan |
|
Depositor: |
Hougardy, Stefan |
|
Date of Deposit: |
2024-05-21 |
|
Holdings Information: |
https://doi.org/10.60507/FK2/XLGFI4 |
|
Study Scope |
|
|
Keywords: |
Computer and Information Science, Mathematical Sciences |
|
Abstract: |
This data set contains triangular nxk arrays with 2<=n, k<=10 using the TSPLIB-format. The instances where generated as part of the master's thesis of Daphne Rohrssen written 2022 under the supervision of Stefan Hougardy at the University of Bonn. Some of these instances are very hard to solve exactly for GeoSteiner 5.1. For example the 4x9 instance with 36 vertices needs more than 10 days of CPU time. SCIP-JACK 2.1 solves this instance within 20 minutes. However, one should be aware of the fact that both codes have numerical problems and cannot guarantee optimality of the solutions. With SCIP-JACK this seems to happen more often than with GeoSteiner. |
|
Methodology and Processing |
|
|
Sources Statement |
|
|
Data Access |
|
|
Other Study Description Materials |
|
|
Label: |
readme.txt |
|
Text: |
readme file |
|
Notes: |
text/plain |
|
Label: |
triangular_instances.zip |
|
Text: |
Steiner tree instances for triangular grids |
|
Notes: |
application/zip |