Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut

  • Immanuel Bomze
  • Markus Chimani
  • Michael Jünger
  • Ivana Ljubić
  • Petra Mutzel
  • Bernd Zey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6506)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Birge, J.R., Louveaux, F.: A multicut algorithm for two-stage stochastic linear programs. European Journal of Operational Research 34, 384–392 (1988)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)MATHGoogle Scholar
  4. 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
  5. 5.
    Carøe, C.C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Mathematical Programming 83(3), 451–464 (1998)MathSciNetCrossRefMATHGoogle Scholar
  6. 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
  7. 7.
    Gupta, A., Hajiaghayi, M., Kumar, A.: Stochastic Steiner tree with non-uniform inflation. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 134–148. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Gupta, A., Ravi, R., Sinha, A.: LP rounding approximation algorithms for stochastic network design. Math. of Operations Research 32(2), 345–364 (2007)MathSciNetCrossRefMATHGoogle Scholar
  9. 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
  10. 10.
    Laporte, G., Louveaux, F.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13, 133–142 (1993)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming 105(2-3), 427–449 (2006)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
  13. 13.
    Shapiro, A., Ruszczynski, A.P., Dentcheva, D.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)CrossRefMATHGoogle Scholar
  14. 14.
  15. 15.
  16. 16.
    Swamy, C., Shmoys, D.: Approximation algorithms for 2-stage stochastic optimization problems 1(37), 33–46 (2006)Google Scholar
  17. 17.
    Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: A computational study. Computational Optimization and Appl. 24(2-3), 289–333 (2003)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Immanuel Bomze
    • 1
  • Markus Chimani
    • 2
  • Michael Jünger
    • 3
  • Ivana Ljubić
    • 1
  • Petra Mutzel
    • 4
  • Bernd Zey
    • 4
  1. 1.Faculty of Business, Economics and StatisticsUniversity of ViennaAustria
  2. 2.Institute of Computer ScienceFriedrich-Schiller-University of JenaGermany
  3. 3.Department of Computer ScienceUniversity of CologneGermany
  4. 4.Department of Computer ScienceTU DortmundGermany

Personalised recommendations