Browsing Faculty of Engineering by Author "Leggieri, V."
Now showing items 1-3 of 3
-
A branch-and-cut algorithm for the Steiner tree problem with delays
Leggieri, V.; Haouari, Mohamed; Triki, C. (Springer Science+Business Media, 2012-12)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 exact algorithm for the Steiner tree problem with delays
Leggieri, V.; Haouari, Mohamed; Triki, C. (Elsevier, 2010-08-01)The 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 ... -
The Steiner tree problem with delays: a compact formulation and reduction procedures
Leggieri, V.; Haouari, Mohamed; Triki, C. (Elsevier, 2014-02-19)This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ...
Share this page