On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
We present mixed integer programming approaches for optimally solving a combinatorial optimization problem arising in network design with additional quality of service constraints. The rooted delay- and delay-variation-constrained Steiner tree problem asks for a cost-minimal Steiner tree satisfying delay-constraints from source to terminals and a maximal variation-bound between particular terminal path-delays. Our MIP models are based on multi-commodity-flows and a layered graph transformation. For the latter model we propose some new sets of valid inequalities and an efficient separation method. Presented experimental results indicate that our layered graph approaches clearly outperform the flow-based model.
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall (1993)Google Scholar
- 6.Haberman, B.K., Rouskas, G.N.: Cost, delay, and delay variation conscious multicast routing. Tech. rep., North Carolina State University (1996)Google Scholar
- 9.Lee, H.-Y., Youn, C.-H.: Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree. In: IEEE International Conference on Communications, vol. 3, pp. 1343–1347. IEEE Press (2000)Google Scholar
- 13.Ruthmair, M., Raidl, G.R.: Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI, Part II. LNCS, vol. 6239, pp. 391–400. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 16.Sheu, P.-R., Tsai, H.-Y., Chen, S.-C.: An Optimal MILP Formulation for the Delay- and Delay Variation-Bounded Multicast Tree Problem. Journal of Internet Technology 8(3), 321–328 (2007)Google Scholar