A branch-and-cut algorithm for the Steiner tree problem with delays
Type :
Article
Publication Status :
published
Access :
restrictedAccess
Abstract
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.
Source :
Optimization Letters
Date :
2012-12
Volume :
6
Issue :
8
Publisher :
Springer Science+Business Media
Collections
Share this page