TY - JOUR
T1 - The Steiner Tree Problem with Delays
T2 - A compact formulation and reduction procedures
AU - Leggieri, Valeria
AU - Haouari, Mohamed
AU - Triki, Chefi
PY - 2014
Y1 - 2014
N2 - 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 formulation for this challenging NP-hard problem. The LP relaxation of this formulation is enhanced through the derivation of new lifted Miller-Tucker-Zemlin subtour elimination constraints. Furthermore, we present several preprocessing techniques for both reducing the problem size and tightening the LP relaxation. Finally, we report the results of extensive computational experiments on instances with up to 1000 nodes. These results attest to the efficacy of the combination of the enhanced formulation and reduction techniques.
AB - 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 formulation for this challenging NP-hard problem. The LP relaxation of this formulation is enhanced through the derivation of new lifted Miller-Tucker-Zemlin subtour elimination constraints. Furthermore, we present several preprocessing techniques for both reducing the problem size and tightening the LP relaxation. Finally, we report the results of extensive computational experiments on instances with up to 1000 nodes. These results attest to the efficacy of the combination of the enhanced formulation and reduction techniques.
KW - MTZ subtour elimination constraints
KW - Reduction techniques
KW - Steiner tree problem
UR - http://www.scopus.com/inward/record.url?scp=84893751291&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893751291&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2011.07.008
DO - 10.1016/j.dam.2011.07.008
M3 - Article
AN - SCOPUS:84893751291
SN - 0166-218X
VL - 164
SP - 178
EP - 190
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - PART 1
ER -