Solving Steiner Tree Problems in Graphs to Optimality

Journal article


Publication Details

Author(s): Koch T, Martin A
Journal: Networks
Publisher: Wiley-Blackwell
Publication year: 1998
Volume: 32
Pages range: 207 -- 232
ISSN: 0028-3045
eISSN: 1097-0037
Language: English


Abstract


In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms, and primal heuristics. We are able to solve nearly all problem instances discussed in the literature to optimality, including one problem that - to our knowledge - has not yet been solved. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called SteinLib that is accessible via the World Wide Web.



FAU Authors / FAU Editors

Martin, Alexander Prof. Dr.
Economics - Discrete Optimization - Mathematics (EDOM)


External institutions
Konrad-Zuse-Zentrum für Informationstechnik / Zuse Institute Berlin (ZIB)


How to cite

APA:
Koch, T., & Martin, A. (1998). Solving Steiner Tree Problems in Graphs to Optimality. Networks, 32, 207 -- 232.

MLA:
Koch, Thorsten, and Alexander Martin. "Solving Steiner Tree Problems in Graphs to Optimality." Networks 32 (1998): 207 -- 232.

BibTeX: 

Last updated on 2018-08-08 at 03:04