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

DOI10.1002/net.21722zbMath1390.90149OpenAlexW2553228024MaRDI QIDQ4565770

Ivana Ljubić, Olaf Maurer, Andreas Bley

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 programmingpolyhedronSteiner treefacetsconnected dominating setthin formulation

Mathematics Subject Classification ID

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

Related Items (3)

A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem ⋮ 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