A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199807)31:4<273::AID-NET7>3.0.CO;2-A" /><273::AID-NET7>3.0.CO;2-A 10.1002/(SICI)1097-0037(199807)31:4<273::AID-NET7>3.0.CO;2-AzbMath1002.90094OpenAlexW2092462680MaRDI QIDQ4540054

Heinrich Hilbert, Uwe H. Suhl

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<273::aid-net7>3.0.co;2-a

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Mathematical formulations for multi-period network design with modular capacity adjustments ⋮ The incremental connected facility location problem

This page was built for publication: A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs