A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree Problem

@article{Cordone2008ARA,
  title={A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree Problem},
  author={Roberto Cordone and Marco Trubian},
  journal={APJOR},
  year={2008},
  volume={25},
  pages={373-391}
}
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… CONTINUE READING
1 Citations
16 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…