Solving Steiner Tree Problems in Graphs to Optimality

Koch T, Martin A (1998)

Publication Language: English

Publication Type: Journal article

Publication year: 1998

Journal

Networks Wiley-Blackwell

Publisher: Wiley-Blackwell

Book Volume: 32

Pages Range: 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 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.

Authors with CRIS profile

Alexander Martin Economics - Discrete Optimization - Mathematics (EDOM)

Involved external institutions

Konrad-Zuse-Zentrum für Informationstechnik / Zuse Institute Berlin (ZIB) DE Germany (DE)

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: Download