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

DOI10.1007/978-3-642-17517-6_38zbMath1311.90085OpenAlexW1552890035WikidataQ56977143 ScholiaQ56977143MaRDI QIDQ3060753

Ivana Ljubić, Petra Mutzel, Michael Jünger, Bernd Zey, Immanuel M. Bomze, Markus Chimani

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://e-archive.informatik.uni-koeln.de/602/2/zaik2010-602.pdf

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)

Related Items (3)

Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Solving minimum-cost shared arborescence problems ⋮ Stochastic survivable network design problems: theory and practice

This page was built for publication: Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut