A strong lower bound for the Node Weighted Steiner Tree Problem

DOI10.1002/(SICI)1097-0037(199801)31:1%3C11::AID-NET2%3E3.0.CO;2-NMaRDI QIDQ4378524zbMATH OpenOpenAlexFDO

Authors Stefan Engevall, Maud Göthe-Lundgren, Peter Värbrand

Publication date 5 March 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199801)31:1%3C11::aid-net2%3E3.0.co;2-n

zbMATH Keywords

Steiner tree problemundirected graphLagrangean relaxationprize-collectingnode weighted Steiner tree problemsubgradient optimizatoin

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The node-weighted steiner tree problem
• An exact algorithm for the node weighted Steiner tree problem
• Some generalizations of the steiner problem in graphs
• The multi-weighted Steiner tree problem

Cited in

(13)

• An exact algorithm for the node weighted Steiner tree problem
• The node-weighted steiner tree problem
• A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
• Optimal relay node placement in delay constrained wireless sensor network design
• A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• Heuristics for automated knowledge source integration and service composition
• A node-based ILP formulation for the node-weighted dominating Steiner problem
• Solving Steiner trees: Recent advances, challenges, and perspectives
• The multi-weighted Steiner tree problem: A reformulation by intersection
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Some generalizations of the steiner problem in graphs

This page was built for publication: A strong lower bound for the Node Weighted Steiner Tree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378524)