A strong lower bound for the Node Weighted Steiner Tree Problem
From MaRDI portal
Publication:4378524
DOI<11::AID-NET2>3.0.CO;2-N 10.1002/(SICI)1097-0037(199801)31:1<11::AID-NET2>3.0.CO;2-NzbMath0894.90151OpenAlexW2065371968MaRDI QIDQ4378524
Maud Göthe-Lundgren, Stefan Engevall, Peter Värbrand
Publication date: 5 March 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n
Lagrangean relaxationSteiner tree problemundirected graphprize-collectingnode weighted Steiner tree problemsubgradient optimizatoin
Related Items (7)
Optimal relay node placement in delay constrained wireless sensor network design ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Local search with perturbations for the prize-collecting Steiner tree problem in graphs ⋮ An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
This page was built for publication: A strong lower bound for the Node Weighted Steiner Tree Problem
