A node-based ILP formulation for the node-weighted dominating Steiner problem

DOI10.1002/NET.21722MaRDI QIDQ4565770zbMATH OpenOpenAlexFDO

Authors Andreas Bley, Ivana Ljubić, Olaf Maurer

Publication date 13 June 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21722

zbMATH Keywords

integer programmingpolyhedronfacetsSteiner treeconnected dominating setthin formulation

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Recommendations

• A strong lower bound for the Node Weighted Steiner Tree Problem
• The node-weighted steiner tree problem
• An exact algorithm for the node weighted Steiner tree problem
• Strong Formulations for 2-Node-Connected Steiner Network Problems
• scientific article; zbMATH DE number 1302025

Cited in

(3)

• A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• A branch-and-cut algorithm for the maximum covering cycle problem

This page was built for publication: A node-based ILP formulation for the node-weighted dominating Steiner problem

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