An exact algorithm for the node weighted Steiner tree problem

Abstract.The Node Weighted Steiner Tree Problem(NW-STP) is a generalization of the Steiner Tree Problem. A lagrangean heuristic presented in EngevallS: StrLBN: 98, and based on the work in Lucena: 92, solves the problem by relaxing an exponential family of generalized subtour elimination constraints and taking into account only the violated ones as the computation proceeds. In EngevallS: StrLBN: 98 the computational results refer to complete graphs up to one hundred vertices. In this paper, we present a branch-and-bound algorithm based on this formulation. Its performance on the instances from the literature confirms the effectiveness of the approach. The experimentation on a newly generated set of benchmark problems, more similar to the real-world applications, shows that the approach is still valid, provided that suitable refinements on the bounding procedures and a preprocessing phase are introduced. The algorithm solves to optimality all of the considered instances up to one thousand vertices, with the exception of 11 hard instances, derived from the literature of a similar problem, the Prize Collecting Steiner Tree Problem.

[1]  Peter Värbrand,et al.  A strong lower bound for the Node Weighted Steiner Tree Problem , 1998, Networks.

[2]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

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

[4]  Petra Mutzel,et al.  Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.

[5]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[6]  Carlos Eduardo Ferreira,et al.  Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem , 2007, Inf. Process. Lett..

[7]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[8]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[9]  A. Volgenant,et al.  Some generalizations of the steiner problem in graphs , 1987, Networks.

[10]  Peter Värbrand,et al.  A strong lower bound for the Node Weighted Steiner Tree Problem , 1998 .

[11]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[12]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[13]  M. Gendreau,et al.  A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.

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

[15]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[16]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[17]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.