Leggieri, V.Haouari, MohamedTriki, C.2014-07-102014-07-102012-121862-4480http://hdl.handle.net/10679/477https://doi.org/10.1007/s11590-011-0368-1Due to copyright restrictions, the access to the full text of this article is only available via subscription.In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present an enhanced directed cut-based MIP formulation and an exact solution method based on a branch-and-cut approach. Our computational study reveals that the proposed approach can optimally solve hard dense instances.engrestrictedAccessarticle681753177100031534800001410.1007/s11590-011-0368-1Steiner tree problemDelay constraintsBranch-and-cut method2-s2.0-84869492644