Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

This paper presents an algorithm to obtain near optimal solutions for the Steiner tree problem in graphs. It is based on a Lagrangian relaxation of a multi-commodity flow formulation of the problem. An extension of the subgradient algorithm, the volume algorithm, has been used to obtain lower bounds and to estimate primal solutions. It was possible to solve several difficult instances from the literature to proven optimality without branching. Computational results are reported for problems drawn from the SteinLib library.

[1]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[2]  Panos M. Pardalos.  Approximation and Complexity in Numerical Optimization , 2000 .

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

[4]  Abilio Lucena,et al.  A Branch and Cut Algorithm for the Steiner Problem in Graphs , 1998 .

[5]  Philip Wolfe,et al.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974, Math. Program..

[6]  Cees Duin,et al.  Efficient path and vertex exchange in steiner tree algorithms , 1997, Networks.

[7]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

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

[10]  Abilio Lucena,et al.  A branch and cut algorithm for the Steiner problem in graphs , 1998, Networks.

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

[12]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[13]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

[14]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

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

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

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

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

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

[20]  Fabián A. Chudak,et al.  Solving Large Scale Uncapacitated Facility Location Problems , 2000 .

[21]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

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

[23]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[24]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[25]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[26]  Nelson Maculan,et al.  The volume algorithm revisited: relation with bundle methods , 2002, Math. Program..

[27]  Pawel Winter,et al.  Path-distance heuristics for the Steiner problem in undirected networks , 1992, Algorithmica.

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

[29]  C. Lemaréchal.  An extension of davidon methods to non differentiable problems , 1975 .

[30]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[31]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

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

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

[34]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

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

[36]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..