{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:28:37Z","timestamp":1778646517506,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,19]],"date-time":"2015-04-19T00:00:00Z","timestamp":1429401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,4,19]],"date-time":"2015-04-19T00:00:00Z","timestamp":1429401600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["SC0005102"],"award-info":[{"award-number":["SC0005102"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["SP0011568"],"award-info":[{"award-number":["SP0011568"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014210051"],"award-info":[{"award-number":["N00014210051"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10589-015-9751-7","type":"journal-article","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T09:10:21Z","timestamp":1429348221000},"page":"669-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Scenario generation for stochastic optimization problems via the sparse grid method"],"prefix":"10.1007","volume":"62","author":[{"given":"Michael","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1vid","family":"Papp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,19]]},"reference":[{"key":"9751_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1017\/S0962492904000182","volume":"13","author":"HJ Bungartz","year":"2004","unstructured":"Bungartz, H.J., Griebel, M.: Sparse grids. Acta Numer. 13, 147\u2013269 (2004). doi:\n                    10.1017\/S0962492904000182","journal-title":"Acta Numer."},{"key":"9751_CR2","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1287\/moor.1050.0146","volume":"30","author":"M Casey","year":"2005","unstructured":"Casey, M., Sen, S.: The scenario generation algorithm for multistage stochastic linear programming. Math. Oper. Res. 30, 615\u2013631 (2005)","journal-title":"Math. Oper. Res."},{"key":"9751_CR3","unstructured":"Chen, M., Mehrotra, S.: Epi-convergent scenario generation method for stochastic problems via sparse grid. Tech. rep., Northwestern University (2007). \n                    http:\/\/edoc.hu-berlin.de\/series\/speps\/2008-7\/PDF\/7.pdf"},{"key":"9751_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"G Consigli","year":"2000","unstructured":"Consigli, G., Dupa\u010dov\u00e1, J., Wallace, S.: Generating scenarios for multistage stochastic programs. Ann. Oper. Res. 100, 25\u201353 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9751_CR5","volume-title":"Methods of Numerical Integration","author":"PJ Davis","year":"1975","unstructured":"Davis, P.J., Rabinowitz, P.: Methods of Numerical Integration. Academic Press, San Diego (1975)"},{"key":"9751_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1018956530304","volume":"90","author":"MAH Dempster","year":"1999","unstructured":"Dempster, M.A.H., Thompson, R.T.: EVPI-based importance sampling solution procedure for multistage stochastic linear programming on parallel MIMD architectures. Ann. Oper. Res. 90, 161\u2013184 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9751_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761188","volume-title":"Digital Nets and Sequences","author":"J Dick","year":"2010","unstructured":"Dick, J., Pillichshammer, F.: Digital Nets and Sequences. Cambridge University Press, Cambridge (2010)"},{"key":"9751_CR8","unstructured":"Donohue, C.: Stochastic network programming and the dynamic vehicle allocation problem. Ph.D. thesis, The University of Michigan, Ann Arbor (1996)"},{"key":"9751_CR9","first-page":"20","volume":"1","author":"CJ Donohue","year":"2006","unstructured":"Donohue, C.J., Birge, J.R.: The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse. Algorithmic Oper.Res. 1, 20\u201330 (2006)","journal-title":"Algorithmic Oper .Res."},{"key":"9751_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10107-002-0331-0","volume":"95","author":"J Dupa\u010dov\u00e1","year":"2003","unstructured":"Dupa\u010dov\u00e1, J., Gr\u00f6we-Kuska, N., R\u00f6misch, W.: Scenario reduction in stochastic programming: an approach using probability metrics. Math. Program. 95, 493\u2013511 (2003)","journal-title":"Math. Program."},{"key":"9751_CR11","volume-title":"Partial Differential Equations","author":"LC Evans","year":"1998","unstructured":"Evans, L.C.: Partial Differential Equations. American Mathematical Society, Providence (1998)"},{"key":"9751_CR12","volume-title":"Real Analysis: Modern Techniques and Their Applications","author":"GB Folland","year":"1999","unstructured":"Folland, G.B.: Real Analysis: Modern Techniques and Their Applications, 2nd edn. Wiley, Hoboken (1999)","edition":"2"},{"issue":"2","key":"9751_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-0427(95)00232-4","volume":"71","author":"A Genz","year":"1996","unstructured":"Genz, A., Keister, B.: Fully symmetric interpolatory rules for multiple integrals over infinite regions with gaussian weight. J. Comput. Appl. Math. 71(2), 299\u2013309 (1996). doi:\n                    10.1016\/0377-0427(95)00232-4","journal-title":"J. Comput. Appl. Math."},{"key":"9751_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1019129717644","volume":"18","author":"T Gerstner","year":"1998","unstructured":"Gerstner, T., Griebel, M.: Numerical integration using sparse grids. Numer. Algorithms 18, 209\u2013232 (1998)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"9751_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jeconom.2007.12.004","volume":"144","author":"F Heiss","year":"2008","unstructured":"Heiss, F., Winschel, V.: Likelihood approximation by numerical integration on sparse grids. J. Econom. 144(1), 62\u201380 (2008). doi:\n                    10.1016\/j.jeconom.2007.12.004","journal-title":"J. Econom."},{"issue":"2","key":"9751_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-007-0197-2","volume":"118","author":"H Heitsch","year":"2007","unstructured":"Heitsch, H., R\u00f6misch, W.: Scenario tree modeling for multistage stochastic programs. Math. Program. 118(2), 371\u2013406 (2007). doi:\n                    10.1007\/s10107-007-0197-2","journal-title":"Math. Program."},{"key":"9751_CR17","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1090\/S0025-5718-2014-02855-X","volume":"83","author":"A Hinrichs","year":"2014","unstructured":"Hinrichs, A., Novak, E., Ullrich, M., Wozniakowski, H.: The curse of dimensionality for numerical integration of smooth functions. Math. Comput. 83, 2853\u20132863 (2014)","journal-title":"Math. Comput."},{"key":"9751_CR18","first-page":"257","volume":"2","author":"M Kaut","year":"2007","unstructured":"Kaut, M., Wallace, S.W.: Evaluation of scenario-generation methods for stochastic programming. Pac. J. Optim. 2, 257\u2013271 (2007)","journal-title":"Pac. J. Optim."},{"key":"9751_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1080\/17442509108833676","volume":"34","author":"AJ King","year":"1991","unstructured":"King, A.J., Wets, R.J.B.: Epi-consistency of convex stochastic programs. Stoch. Stoch. Rep. 34, 83\u201392 (1991)","journal-title":"Stoch. Stoch. Rep."},{"key":"9751_CR20","volume-title":"Approximate Calculation of Integrals","author":"VI Krylov","year":"2005","unstructured":"Krylov, V.I.: Approximate Calculation of Integrals. Dover, Mineola (2005)"},{"key":"9751_CR21","doi-asserted-by":"publisher","unstructured":"Kuo, F.: Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces. J. Complex. 19(3), 301\u2013320 (2003). doi:\n                    10.1016\/S0885-064X(03)00006-2\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0885064X03000062","DOI":"10.1016\/S0885-064X(03)00006-2"},{"key":"9751_CR22","unstructured":"L\u2019Ecuyer, P., Munger, D.: LatticeBuilder: A general software tool for constructing rank-1 lattice rules. Submitted (2012). Software downloadable from \n                    http:\/\/www.iro.umontreal.ca\/simardr\/latbuilder\/latbuilder.html"},{"key":"9751_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-27440-4_6","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods 2010","author":"P L\u2019Ecuyer","year":"2012","unstructured":"L\u2019Ecuyer, P., Munger, D.: On figures of merit for randomly-shifted lattice rules. In: Wozniakowski, H., Plaskota, L. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2010, pp. 133\u2013159. Springer, Berlin (2012)"},{"key":"9751_CR24","unstructured":"Mehrotra, S., Papp, D.: Generating nested quadrature formulas for general weight functions with known moments. Tech. Rep. \n                    arXiv:1203.1554v1\n                    \n                   [math.NA], Northwestern University (2012). \n                    http:\/\/arxiv.org\/abs\/1203.1554v1"},{"issue":"2","key":"9751_CR25","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/110858082","volume":"23","author":"S Mehrotra","year":"2013","unstructured":"Mehrotra, S., Papp, D.: Generating moment matching scenarios using optimization techniques. SIAM J. Optim. 23(2), 963\u2013999 (2013). doi:\n                    10.1137\/110858082","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9751_CR26","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/1024039","volume":"24","author":"G Monegato","year":"1982","unstructured":"Monegato, G.: Stieltjes polynomials and related quadrature rules. SIAM Rev. 24(2), 137\u2013158 (1982)","journal-title":"SIAM Rev."},{"key":"9751_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511612916","volume-title":"Introduction to Numerical Analysis","author":"A Neumaier","year":"2001","unstructured":"Neumaier, A.: Introduction to Numerical Analysis. Cambridge University Press, Cambridge (2001)"},{"key":"9751_CR28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics","author":"H Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 63. SIAM, Philadelphia (1992)"},{"key":"9751_CR29","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","year":"2006","unstructured":"Niederreiter, H., Talay, D. (eds.): Monte Carlo and Quasi-Monte Carlo Methods. Springer, Berlin (2006)"},{"key":"9751_CR30","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF02680569","volume":"83","author":"V Norkin","year":"1998","unstructured":"Norkin, V., Pflug, G., Ruszczy\u0144ski, A.: A branch and bound method for stochastic global optimization. Math. Program. 83, 425\u2013450 (1998). doi:\n                    10.1007\/BF02680569","journal-title":"Math. Program."},{"key":"9751_CR31","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s002110050231","volume":"75","author":"E Novak","year":"1996","unstructured":"Novak, E., Ritter, K.: High dimensional integration of smooth functions over cubes. Numer. Math. 75, 79\u201397 (1996)","journal-title":"Numer. Math."},{"key":"9751_CR32","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s003659900119","volume":"15","author":"E Novak","year":"1999","unstructured":"Novak, E., Ritter, K.: Simple cubature formulas with high polynomial exactness. Constr. Approx. 15, 499\u2013522 (1999)","journal-title":"Constr. Approx."},{"issue":"104","key":"9751_CR33","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1090\/S0025-5718-68-99866-9","volume":"22","author":"TNL Patterson","year":"1968","unstructured":"Patterson, T.N.L.: The optimal addition of points to quadrature formulae. Math. Comput. 22(104), 847\u2013856 (1968)","journal-title":"Math. Comput."},{"key":"9751_CR34","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/63522.63523","volume":"15","author":"TNL Patterson","year":"1989","unstructured":"Patterson, T.N.L.: An algorithm for generating interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions. ACM Trans. Math. Softw. 15, 123\u2013136 (1989). doi:\n                    10.1145\/63522.63523","journal-title":"ACM Trans. Math. Softw."},{"key":"9751_CR35","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/moor.1040.0114","volume":"30","author":"T Pennanen","year":"2005","unstructured":"Pennanen, T.: Epi-convergent discretizations of multistage stochastic programs. Math. Oper. Res. 30, 245\u2013256 (2005)","journal-title":"Math. Oper. Res."},{"key":"9751_CR36","unstructured":"Pennanen, T., Koivu, M.: Integration quadrature in discretization of stochastic programs. Stoch. Program. E-Print Series (2002\u201311)"},{"key":"9751_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00211-004-0571-4","volume":"100","author":"T Pennanen","year":"2005","unstructured":"Pennanen, T., Koivu, M.: Epi-convergent discretizations of stochastic programs via integration quadratures. Numer. Math. 100, 141\u2013163 (2005). doi:\n                    10.1007\/s00211-004-0571-4","journal-title":"Numer. Math."},{"key":"9751_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/PL00011398","volume":"89","author":"GC Pflug","year":"2001","unstructured":"Pflug, G.C.: Scenario tree generation for multiperiod financial optimization by optimal discretization. Math. Program. 89, 251\u2013271 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"9751_CR39","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2(3), 21\u201341 (2000)","journal-title":"J. Risk"},{"key":"9751_CR40","volume-title":"Real and Complex Analysis","author":"W Rudin","year":"1986","unstructured":"Rudin, W.: Real and Complex Analysis. McGraw-Hill, New York (1986)"},{"key":"9751_CR41","first-page":"240","volume":"4","author":"SA Smoljak","year":"1963","unstructured":"Smoljak, S.A.: Quadrature and interpolation formulas for tensor products of certain classes of functions. Dokl. Akad. Nauk SSSR 4, 240\u2013243 (1963)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9751_CR42","volume-title":"A Primer for the Monte Carlo Method","author":"IM Sobol","year":"1994","unstructured":"Sobol, I.M.: A Primer for the Monte Carlo Method. CRC Press, Boca Raton (1994)"},{"key":"9751_CR43","volume-title":"Applications Of Stochastic Programming","year":"2005","unstructured":"Wallace, S.W., Ziemba, W.T. (eds.): Applications Of Stochastic Programming. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"issue":"1","key":"9751_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcom.1995.1001","volume":"11","author":"GW Wasilkowski","year":"1995","unstructured":"Wasilkowski, G.W., Wozniakowski, H.: Explicit cost bounds of algorithms for multivariate tensor product problems. J. Complex. 11(1), 1\u201356 (1995)","journal-title":"J. Complex."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9751-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9751-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9751-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9751-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:52:43Z","timestamp":1589712763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9751-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,19]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9751"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9751-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,19]]},"assertion":[{"value":"22 October 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}