A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM

The Knapsack Node Weighted Steiner Tree Problem (KNWSTP) is a generalization of the Steiner Tree Problem on graphs, which takes into account the classical cost function defined on the edges, as well as a prize function defined on the vertices and a limit on the size of the solution. It has several applications to network design. We propose an exact branch-and-bound algorithm for this problem, based on a relax-and-cut approach: the algorithm relaxes an exponential family of generalized subtour elimination constraints and takes into account only the violated ones as the computation proceeds. The performance of the algorithm has been tested on a wide set of benchmark problems, up to three hundred vertices, whose structure reflects the features of the most likely applications (sparse graphs with Euclidean costs) and covers different cases with respect to the prize function (only positive, or both positive and negative prizes) and the weight threshold.