Leggieri, V.Haouari, MohamedTriki, C.2012-05-302012-05-302010-08-011571-0653http://hdl.handle.net/10679/183https://doi.org/10.1016/j.endm.2010.05.029The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a Branch-and-Cut algorithm for solving this problem using a formulation based on lifted Miller-Tucker-Zemlin subtour elimination constraints. The effectiveness of the proposed algorithm is assessed through computational experiments carried out on dense benchmark instances.engrestrictedAccessconferenceObject3622323010.1016/j.endm.2010.05.029Steiner tree problemMTZ subtour elimination constraintsBranch-and-cut2-s2.0-77954936857