Stabilized branch-and-price for the rooted delay-constrained steiner tree problem

  • Authors:

  • Markus Leitner;Mario Ruthmair;Günther R. Raidl

  • Affiliations:

  • Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria

  • Venue:
  • INOC'11 Proceedings of the 5th international conference on Network optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the rooted delay-constrained Steiner tree problem which arises, e.g., in the design of centralized multicasting networks where quality of service constraints are of concern. We present a mixed integer linear programming formulation based on the concept of feasible paths which has already been considered in the literature for the spanning tree variant. Solving its linear relaxation by column generation has, however, been regarded as computationally not competitive. In this work, we study various possibilities to speed-up the solution of our model by stabilization techniques and embed the column generation procedure in a branch-and-price approach in order to compute proven optimal solutions. Computational results show that the best among the resulting stabilized branch-and-price variants outperforms so-far proposed methods.