Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage when only probabilistic information on the set of terminals and the future edge costs is known. In the second stage, one of the given scenarios is realized and additional edges are purchased to interconnect the set of (now known) terminals. The goal is to choose an edge set to be purchased in the first stage while minimizing the overall expected cost of the solution.
We provide a new semi-directed cut-set based integer programming formulation that is stronger than the previously known undirected model. To solve the formulation to provable optimality, we suggest a two-stage branch-and-cut framework, facilitating (integer) L-shaped cuts. The framework itself is also applicable to a range of other stochastic problems.
As SSTP has yet been investigated only from the theoretical point of view, we also present the first computational study for SSTP, showcasing the applicability of our approach and its benefits over solving the extensive form of the deterministic equivalent directly.
KeywordsSteiner Tree Network Design Problem Steiner Tree Problem Integer Linear Programming Model Edge Cost
Unable to display preview. Download preview PDF.
- 4.Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: ACM STOC (to appear, 2010)Google Scholar
- 6.Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation algorithms for NP-hard problems, pp. 144–191 (1996)Google Scholar
- 9.Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting Steiner tree problem: Theory and practice. In: ACM-SIAM SODA, pp. 760–769. SIAM, Philadelphia (2000)Google Scholar
- 12.PCSTP Benchmark, http://homepage.univie.ac.at/ivana.ljubic/research/pcstp/
- 15.SteinLib, http://steinlib.zib.de/steinlib.php
- 16.Swamy, C., Shmoys, D.: Approximation algorithms for 2-stage stochastic optimization problems 1(37), 33–46 (2006)Google Scholar