Solving Steiner tree problems in graphs to optimality

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. q 1998 John Wiley & Sons, Inc. Networks 32: 207–232, 1998

[1]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[2]  Martin Grötschel,et al.  Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..

[3]  Victor J. Rayward-Smith,et al.  On finding steiner vertices , 1986, Networks.

[4]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[5]  David M. Warme.  A new exact algorithm for rectilinear Steiner trees , 1997, Network Design: Connectivity and Facilities Location.

[6]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[7]  M. R. Rao,et al.  Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..

[8]  Conclusions , 1989 .

[9]  A. Volgenant,et al.  An edge elimination test for the steiner problem in graphs , 1989 .

[10]  Martin Grötschel,et al.  Packing Steiner trees: a cutting plane algorithm and computational results , 1996, Math. Program..

[11]  J. Soukup,et al.  Set of test problems for the minimum length connection networks , 1973, SMAP.

[12]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[13]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[14]  Michael Jünger,et al.  Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits , 1994, Math. Program..

[15]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[16]  A. Volgenant,et al.  Reduction tests for the steiner problem in grapsh , 1989, Networks.

[17]  M. R. Rao,et al.  The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

[18]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[19]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[20]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[21]  Pawel Winter.  Reductions for the rectilinear steiner tree problem , 1995, Networks.

[22]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[23]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[24]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[25]  Anantaram Balakrishnan,et al.  Problem reduction methods and a tree generation algorithm for the steiner network problem , 1987, Networks.

[26]  James B. Orlin,et al.  A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.

[27]  M. R. Rao,et al.  The Steiner tree problem II: Properties and classes of facets , 1994, Math. Program..