{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:45:36Z","timestamp":1775180736780,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175169","type":"print"},{"value":"9783642175176","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_38","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"427-439","source":"Crossref","is-referenced-by-count":7,"title":["Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut"],"prefix":"10.1007","author":[{"given":"Immanuel","family":"Bomze","sequence":"first","affiliation":[]},{"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"given":"Bernd","family":"Zey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"J.R. Birge","year":"1988","unstructured":"Birge, J.R., Louveaux, F.: A multicut algorithm for two-stage stochastic linear programs. European Journal of Operational Research\u00a034, 384\u2013392 (1988)","journal-title":"European Journal of Operational Research"},{"key":"38_CR3","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"key":"38_CR4","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: ACM STOC (to appear, 2010)"},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"C.C. Car\u00f8e","year":"1998","unstructured":"Car\u00f8e, C.C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Mathematical Programming\u00a083(3), 451\u2013464 (1998)","journal-title":"Mathematical Programming"},{"key":"38_CR6","unstructured":"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\u2013191 (1996)"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-74208-1_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2007","unstructured":"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.\u00a04627, pp. 134\u2013148. Springer, Heidelberg (2007)"},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/moor.1060.0237","volume":"32","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Ravi, R., Sinha, A.: LP rounding approximation algorithms for stochastic network design. Math. of Operations Research\u00a032(2), 345\u2013364 (2007)","journal-title":"Math. of Operations Research"},{"key":"38_CR9","first-page":"760","volume-title":"ACM-SIAM SODA","author":"D.S. Johnson","year":"2000","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting Steiner tree problem: Theory and practice. In: ACM-SIAM SODA, pp. 760\u2013769. SIAM, Philadelphia (2000)"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett.\u00a013, 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"2-3","key":"38_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107, 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\u00a0105(2-3), 427\u2013449 (2006)","journal-title":"Mathematical Programming"},{"key":"38_CR12","unstructured":"PCSTP Benchmark, http:\/\/homepage.univie.ac.at\/ivana.ljubic\/research\/pcstp\/"},{"key":"38_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A. Shapiro","year":"2009","unstructured":"Shapiro, A., Ruszczynski, A.P., Dentcheva, D.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"38_CR14","unstructured":"SSTPLib, http:\/\/ls11-www.cs.tu-dortmund.de\/staff\/zey\/sstp"},{"key":"38_CR15","unstructured":"SteinLib, http:\/\/steinlib.zib.de\/steinlib.php"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Swamy, C., Shmoys, D.: Approximation algorithms for 2-stage stochastic optimization problems 1(37), 33\u201346 (2006)","DOI":"10.1145\/1122480.1122493"},{"issue":"2-3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B. Verweij","year":"2003","unstructured":"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.\u00a024(2-3), 289\u2013333 (2003)","journal-title":"Computational Optimization and Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:30Z","timestamp":1559836170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}