{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T07:34:44Z","timestamp":1769758484293,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,8,22]],"date-time":"2006-08-22T00:00:00Z","timestamp":1156204800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMS"],"published-print":{"date-parts":[[2007,8,15]]},"DOI":"10.1007\/s10287-006-0026-8","type":"journal-article","created":{"date-parts":[[2006,8,21]],"date-time":"2006-08-21T07:28:03Z","timestamp":1156145283000},"page":"313-353","source":"Crossref","is-referenced-by-count":53,"title":["Solving two-stage stochastic programming problems with level decomposition"],"prefix":"10.1007","volume":"4","author":[{"given":"Csaba I.","family":"F\u00e1bi\u00e1n","sequence":"first","affiliation":[]},{"given":"Zolt\u00e1n","family":"Sz\u0151ke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,22]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-1-4757-3216-0_8","volume-title":"High performance optimization.","author":"ED Andersen","year":"2000","unstructured":"Andersen ED, Andersen KD (2000) The MOSEK interior-point optimizer for linear programming: an implementation of the homogeneous algorithm. In: Frenk H, Roos K, Terlaky T, Zhang S, (eds) High performance optimization. Kluwer, Dordrecht, pp 197\u2013232"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","volume":"17","author":"EML Beale","year":"1955","unstructured":"Beale EML (1955) On minimizing a convex function subject to linear inequalities. J R Stat Soc Ser B 17:173\u2013184","journal-title":"J R Stat Soc Ser B"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238\u2013252 republished in Comput Manage Sci 2:3\u201319 (2005)","DOI":"10.1007\/BF01386316"},{"key":"26_CR4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge JR, Louveaux FV (1997) Introduction to Stochastic Programming. Springer, Berlin Heidelberg New York"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Birge JR, Wets RJ-B (1986) Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse. In: Pr\u00e9kopa A, Wets RJ-B (eds) Stochastic Programming 84, Vol 1. Mathematical Programming Study 27:54\u2013102","DOI":"10.1007\/BFb0121114"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rck \u00c5 (1996) Numerical methods for least squares problems. Society for Industrial and Applied Mathematics, Philadelphia","DOI":"10.1137\/1.9781611971484"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"GB Dantzig","year":"1955","unstructured":"Dantzig GB (1955) Linear programming under uncertainty. Manage Sci 1:197\u2013206","journal-title":"Manage Sci"},{"key":"26_CR8","unstructured":"Dantzig GB, Madansky A (1961) On the solution of two-stage linear programs under uncertainty. In: Proceedings of the 4th Berkeley symposium on mathematical statistics and probability, vol 1: pp 165\u2013176. University of California Press, Berkeley"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) The decomposition principle for linear programs. Oper Res 8:101\u2013111","journal-title":"Oper Res"},{"key":"26_CR10","unstructured":"F\u00e1bi\u00e1n CI (2000) Csendes T, Rapcs\u00e1k T (eds) Bundle-type methods for inexact data. Central Eur J Oper Res 8 (special issue); 35\u201355"},{"key":"26_CR11","unstructured":"F\u00e1bi\u00e1n CI (2005) Decomposing CVaR minimization in two\u2013stage stochastic models. Stochastic Programming E-Print Series 20"},{"key":"26_CR12","unstructured":"F\u00e1bi\u00e1n CI (2006) Handling CVaR objectives and constraints in two-stage stochastic models. RUTCOR Research Report, vol 5"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/moor.13.3.377","volume":"13","author":"K Frauendorfer","year":"1988","unstructured":"Frauendorfer K (1988) Solving SLP recourse problems with arbitrary multivariate distributions \u2013 the dependent case. Math Oper Res 13:377\u2013394","journal-title":"Math Oper Res"},{"key":"26_CR14","first-page":"177","volume":"17","author":"K Frauendorfer","year":"1988","unstructured":"Frauendorfer K, Kall P (1988) A solution method for SLP recourse problems with arbitrary distributions \u2013 The independent case. Probl Control Inf Theory 17:177\u2013205","journal-title":"Probl Control Inf Theory"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187648","volume":"64","author":"HI Gassmann","year":"1996","unstructured":"Gassmann HI, Wallace SW (1996) Solving linear programs with multiple right\u2013hand sides: pricing and ordering schemes. Ann Oper Res 64:237\u2013259","journal-title":"Ann Oper Res"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1137\/S1052623401393141","volume":"13","author":"J Gondzio","year":"2003","unstructured":"Gondzio J, Grothey A (2003) Reoptimization with the primal-dual interior point method. SIAM J Optim 13:842\u2013864","journal-title":"SIAM J Optim"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-51572-9_10","volume-title":"Recent Results in Stochastic Programming, Lecture Notes in Economics and Math. Systems 170","author":"P Kall","year":"1980","unstructured":"Kall P (1980) Solving complete fixed recourse problems by successive discretization. In: Kall P, Pr\u00e9kopa A (eds) Recent Results in Stochastic Programming, Lecture Notes in Economics and Math. Systems 170. Springer, Berlin, Heidelberg New York, pp 135\u2013138"},{"key":"26_CR18","volume-title":"Stochastic Linear Programming: models, theory, and computation. International series in operations research and management science","author":"P Kall","year":"2005","unstructured":"Kall P, Mayer J (2005) Stochastic Linear Programming: Models, Theory, and Computation. International series in operations research and management science. Springer, Berlin, Heidelberg New York"},{"key":"26_CR19","first-page":"431","volume":"13","author":"P Kall","year":"1982","unstructured":"Kall P, Stoyan D (1982) Solving stochastic programming problems with recourse including error bounds. Math Opernforsch Stat Ser Optim 13:431\u2013447","journal-title":"Math Opernforsch Stat Ser Optim"},{"key":"26_CR20","volume-title":"Stochastic programming","author":"P Kall","year":"1994","unstructured":"Kall P, Wallace SW (1994) Stochastic programming. Wiley, Chichester"},{"key":"26_CR21","volume-title":"Algorithms for Network Programming","author":"JL Kennington","year":"1980","unstructured":"Kennington JL, Helgason RV (1980) Algorithms for Network Programming. Wiley, New York"},{"key":"26_CR22","first-page":"269","volume":"8","author":"E Klafszky","year":"1992","unstructured":"Klafszky E, Terlaky T (1992) On the ellipsoid method. Radov Mat 8:269\u2013280","journal-title":"Radov Mat"},{"key":"26_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51697-9","volume-title":"Duality in stochastic linear and dynamic programming. Lecture Notes in Economics and Mathematical Systems, vol 274","author":"WK Klein Haneveld","year":"1986","unstructured":"Klein Haneveld WK (1986) Duality in stochastic linear and dynamic programming. Lecture Notes in Economics and Mathematical Systems, vol 274. Springer, Berlin Heidelberg New York"},{"key":"26_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10287-005-0042-0","volume":"3","author":"A K\u00fcnzi-Bay","year":"2006","unstructured":"K\u00fcnzi-Bay A, Mayer J (2006) Computational aspects of minimizing conditional value-at-risk. Comput Manage Sci 3:3\u201327","journal-title":"Comput Manage Sci"},{"key":"26_CR25","unstructured":"Lemar\u00e9chal C (1982) Basic theory in nondifferentiable optimization. Research Report No. 181, Institut National de Recherche en Informatique at en Automatique, Domaine de Voluceau, Rocquencourt, France"},{"key":"26_CR26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal C, Nemirovskii A, Nesterov Yu (1995) New variants of bundle methods. Math Program 69:111\u2013147","journal-title":"Math Program"},{"key":"26_CR27","unstructured":"Linderoth JT, Shapiro A, Wright SJ (2002) The empirical behavior of sampling methods for stochastic programming. Optimization Technical Report 02-01. Computer Science Department, University of Wisconsin-Madison"},{"key":"26_CR28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"W-K Mak","year":"1999","unstructured":"Mak W-K, Morton D, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett 24:47\u201356","journal-title":"Oper Res Lett"},{"key":"26_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00448-4","volume":"149","author":"I Maros","year":"2003a","unstructured":"Maros I (2003a) A generalized dual phase-2 simplex algorithm. Eur J Oper Res 149:1\u201316","journal-title":"Eur J Oper Res"},{"key":"26_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0257-9","volume-title":"Computational techniques of the simplex method","author":"I Maros","year":"2003b","unstructured":"Maros I (2003b) Computational techniques of the simplex method. Kluwer, Boston"},{"key":"26_CR31","volume-title":"Stochastic linear programming algorithms","author":"J Mayer","year":"1998","unstructured":"Mayer J (1998) Stochastic linear programming algorithms. Gordon and Breach, Amsterdam"},{"key":"26_CR32","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/opre.43.3.477","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey JM, Ruszczy\u0144ski A (1995) A new scenario decomposition method for large scale stochastic optimization. Oper Res 43:477\u2013490","journal-title":"Oper Res"},{"key":"26_CR33","first-page":"425","volume":"83","author":"VI Norkin","year":"1998","unstructured":"Norkin VI, Pflug GCh, Ruszczy\u0144ski A (1998) A branch and bound method for stochastic global optimization. Math program 83:425\u2013450","journal-title":"Math program"},{"key":"26_CR34","first-page":"301","volume":"32","author":"A Pr\u00e9kopa","year":"1971","unstructured":"Pr\u00e9kopa A (1971) Logarithmic concave measures with applications to stochastic programming. Acta Sci Math (Szeged) 32:301\u2013316","journal-title":"Acta Sci Math (Szeged)"},{"key":"26_CR35","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BF01584661","volume":"4","author":"A Pr\u00e9kopa","year":"1973","unstructured":"Pr\u00e9kopa A (1973) Contributions to the theory of stochastic programming. Math Program 4:202\u2013221","journal-title":"Math Program"},{"key":"26_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa A (1995). Stochastic Programming. Kluwer, Dordrecht"},{"key":"26_CR37","doi-asserted-by":"crossref","unstructured":"Pr\u00e9kopa A (2003) Probabilistic programming. In: Ruszczy\u0144ski A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science vol 10, pp 267\u2013351 Elsevier, Amsterdam","DOI":"10.1016\/S0927-0507(03)10005-9"},{"key":"26_CR38","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 2:21\u201341","journal-title":"J Risk"},{"key":"26_CR39","volume-title":"Theory and Algorithms for Linear optimization","author":"C Roos","year":"1997","unstructured":"Roos C, Terlaky T, Vial J-Ph (1997) Theory and Algorithms for Linear optimization. Wiley, Chichester"},{"key":"26_CR40","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski A (1986) A regularized decomposition method for minimizing the sum of polyhedral functions. Math Program 35:309\u2013333","journal-title":"Math Program"},{"key":"26_CR41","doi-asserted-by":"crossref","unstructured":"Ruszczy\u0144ski A (2003) Decomposition methods. In: Ruszczy\u0144ski A, Shapiro A (eds) Stochastic Programming. Handbooks in Operations Research and Management Science, vol 10, pp 141-211 Elsevier, Amsterdam","DOI":"10.1016\/S0927-0507(03)10003-5"},{"key":"26_CR42","doi-asserted-by":"crossref","unstructured":"Ruszczy\u0144ski A, Shapiro A (2003) Stochastic Programming Models. In: Ruszczy\u0144ski A, Shapiro A (eds)Stochastic Programming. Handbooks in Operations Research and Management Science, vol 10, pp 1-64 Elsevier, Amsterdam","DOI":"10.1016\/S0927-0507(03)10001-1"},{"key":"26_CR43","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0377-2217(96)00401-8","volume":"101","author":"A Ruszczy\u0144ski","year":"1997","unstructured":"Ruszczy\u0144ski A, \u015awietanowski A (1997) Accelerating the regularized decomposition method for two-stage stochastic linear problems. Eur J Oper Res 101:328\u2013342","journal-title":"Eur J Oper Res"},{"key":"26_CR44","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, Chichester"},{"key":"26_CR45","doi-asserted-by":"crossref","unstructured":"Shapiro A (2003) Monte Carlo sampling methods. In: Ruszczy\u0144ski A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science, vol 10\u00a0pp 353\u2013425 Elsevier, Amsterdam","DOI":"10.1016\/S0927-0507(03)10006-0"},{"key":"26_CR46","first-page":"301","volume":"81","author":"A Shapiro","year":"1998","unstructured":"Shapiro A, Homem-de-Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math Program 81:301\u2013325","journal-title":"Math Program"},{"key":"26_CR47","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/S1052623498349541","volume":"11","author":"A Shapiro","year":"2000","unstructured":"Shapiro A, Homem-de-Mello T (2000) On the rate of convergence of Monte Carlo approximations of stochastic programs. SIAM J Optim 11:70\u201386","journal-title":"SIAM J Optim"},{"key":"26_CR48","volume-title":"Numerical Techniques for Stochastic Optimization.","author":"T Sz\u00e1ntai","year":"1988","unstructured":"Sz\u00e1ntai T (1988) A computer code for the solution of probabilistic-constrained stochastic programming problems. In: Ermoliev Yu, Wets RJ-B (eds) Numerical Techniques for Stochastic Optimization. Springer, Berlin Heidelberg New York"},{"key":"26_CR49","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R Van Slyke","year":"1969","unstructured":"Van Slyke R, Wets RJ-B (1969) L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM J Appl Math 17:638\u2013663","journal-title":"SIAM J Appl Math"},{"key":"26_CR50","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/1016053","volume":"16","author":"RJ-B Wets","year":"1974","unstructured":"Wets RJ-B (1974) Stochastic programs with fixed recourse: the equivalent deterministic program. SIAM Review 16:309\u2013339","journal-title":"SIAM Review"},{"key":"26_CR51","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/S1052623497318700","volume":"10","author":"G Zakeri","year":"2000","unstructured":"Zakeri G, Philpott AB, Ryan DM (2000) Inexact cuts in Benders decomposition. SIAM J Optim 10:643\u2013657","journal-title":"SIAM J Optim"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-006-0026-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-006-0026-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-006-0026-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:24:58Z","timestamp":1736519098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-006-0026-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,22]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,8,15]]}},"alternative-id":["26"],"URL":"https:\/\/doi.org\/10.1007\/s10287-006-0026-8","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,22]]}}}