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

Roberto Cordone () and Marco Trubian ()
Additional contact information
Roberto Cordone: DTI — Università degli Studi di Milano, via Bramante, 65, Crema, 26013, Italy
Marco Trubian: DSI — Università degli Studi di Milano, via Comelico 39/41, Milano, 20135, Italy

Asia-Pacific Journal of Operational Research (APJOR), 2008, vol. 25, issue 03, 373-391

Abstract: TheKnapsack 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.

Keywords: Node Weighted Steiner Tree Problem; knapsack constraint; relax and cut algorithm (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595908001791
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:25:y:2008:i:03:n:s0217595908001791

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595908001791

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().