Konrad-Zuse-Zentrum für Informationstechnik Berlin ZIB PaperWeb

SC 96-42

Thorsten Koch, Alexander Martin Solving Steiner Tree Problems in Graphs to Optimality Appeared in: Networks 32, 1998, 207-232

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 all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. 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 World Wide Web.