SteinLib: An Updated Library on Steiner Tree Problems in Graphs
Please always quote using this URN: urn:nbn:de:0297-zib-6056
- In this paper we present the {\em SteinLib}, a library of data sets for the Steiner tree problem in graphs. This library extends former libraries on Steiner tree problems by many new interesting and difficult instances, most of them arising from real-world applications. We give a survey on the difficulty of these problem instances by giving references to state-of-the-art software packages that were the first or are currently among the best to solve these instances.
Download full text files
Additional Services
| Author: | Thorsten KochORCiD, Alexander Martin, Stefan Voß |
|---|---|
| Document Type: | ZIB-Report |
| Tag: | Mathematical Programming Testdata Library; Steiner Trees |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming |
| 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
| 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C35 Programming involving graphs or networks [See also 90C27] | |
| Date of first Publication: | 2000/11/27 |
| Series (Serial Number): | ZIB-Report (00-37) |
| ZIB-Reportnumber: | 00-37 |
| Published in: | Appeared in: Steiner Trees in Industry. D.-Z. Du, X. Cheng (eds.) Kluwer 2001, pp. 285-325 |
