TY - JOUR
T1 - A branch-and-cut algorithm for the Steiner tree problem with delays
AU - Leggieri, V.
AU - Haouari, M.
AU - Triki, C.
PY - 2012/11
Y1 - 2012/11
N2 - 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.
AB - 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.
KW - Branch-and-cut method
KW - Delay constraints
KW - Steiner tree problem
UR - http://www.scopus.com/inward/record.url?scp=84869492644&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84869492644&partnerID=8YFLogxK
U2 - 10.1007/s11590-011-0368-1
DO - 10.1007/s11590-011-0368-1
M3 - Article
AN - SCOPUS:84869492644
SN - 1862-4472
VL - 6
SP - 1753
EP - 1771
JO - Optimization Letters
JF - Optimization Letters
IS - 8
ER -