{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:33:09Z","timestamp":1761888789663,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s13675-015-0038-7","type":"journal-article","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T08:24:54Z","timestamp":1431073494000},"page":"349-370","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Solving multistage quantified linear optimization problems with the alpha\u2013beta nested Benders decomposition"],"prefix":"10.1016","volume":"3","author":[{"given":"Ulf","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1957","series-title":"Dynamic programming","author":"Bellmann","key":"10.1007\/s13675-015-0038-7_CR1"},{"year":"2009","series-title":"Robust optimization","author":"Ben-Tal","key":"10.1007\/s13675-015-0038-7_CR2"},{"key":"10.1007\/s13675-015-0038-7_CR3","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","article-title":"Robust solutions of linear programming problems contaminated with uncertain data","volume":"88","author":"Ben-Tal","year":"2000","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-015-0038-7_CR4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","article-title":"Robust optimization\u2014methodology and applications","volume":"92","author":"Ben-Tal","year":"2002","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-015-0038-7_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numer Math"},{"key":"10.1007\/s13675-015-0038-7_CR6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02592158","article-title":"A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs","volume":"75","author":"Birge","year":"1996","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0038-7_CR7","unstructured":"Birge JR, Louveaux F (1997) Introduction to stochastic programming. In: Springer series in operations research and financial engineering. Springer, New York"},{"issue":"3","key":"10.1007\/s13675-015-0038-7_CR8","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","article-title":"A multicut algorithm for two-stage stochastic linear programs","volume":"34","author":"Birge","year":"1988","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13675-015-0038-7_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","article-title":"Chance-constrained programming","volume":"6","author":"Charnes","year":"1959","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-015-0038-7_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1018996821817","article-title":"Parallelization and aggregation of nested benders decomposition","volume":"81","author":"Dempster","year":"1998","journal-title":"Ann Oper Res"},{"issue":"3","key":"10.1007\/s13675-015-0038-7_CR11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-005-0597-0","article-title":"Computational complexity of stochastic programming problems","volume":"106","author":"Dyer","year":"2006","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0038-7_CR12","doi-asserted-by":"crossref","unstructured":"Ederer T, Lorenz U, Martin A, Wolf J (2011) Quantified linear programs: a computational study. In: Proceedings of the 18th annual European conference on Algorithms: part I (ESA\u201911). Springer, Berlin, pp 203\u2013214","DOI":"10.1007\/978-3-642-23719-5_18"},{"issue":"1-3","key":"10.1007\/s13675-015-0038-7_CR13","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF01580872","article-title":"Mslip: a computer code for the multistage stochastic linear programming problem","volume":"47","author":"Gassmann","year":"1990","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0038-7_CR14","doi-asserted-by":"crossref","unstructured":"Kleywegt A, Shapiro A, Homem-De-Mello T (2001) The sample average approximation method for stochastic discrete optimization. SIAM J Opt 12:479\u2013502","DOI":"10.1137\/S1052623499363220"},{"issue":"4","key":"10.1007\/s13675-015-0038-7_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artif Intell"},{"key":"10.1007\/s13675-015-0038-7_CR16","doi-asserted-by":"crossref","unstructured":"Liebchen C, L\u00fcbbecke M, M\u00f6hring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Robust and online large-scale optimization, pp 1\u201327","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"10.1007\/s13675-015-0038-7_CR17","doi-asserted-by":"crossref","unstructured":"Lorenz U, Martin A, Wolf J (2010) Polyhedral and algorithmic properties of quantified linear programs. In: Proceedings of the 18th annual European conference on Algorithms: part I (ESA\u201910). Springer, Berlin, pp 512\u2013523","DOI":"10.1007\/978-3-642-15775-2_44"},{"key":"10.1007\/s13675-015-0038-7_CR18","doi-asserted-by":"crossref","unstructured":"Lorenz U, Opfer T, Wolf J (2014) Solution techniques for quantified linear programs and the links to gaming. In: Computers and games\u20148th international conference (CG\u201913), Yokohama","DOI":"10.1007\/978-3-319-09165-5_10"},{"key":"10.1007\/s13675-015-0038-7_CR19","doi-asserted-by":"crossref","unstructured":"Megow N, Vredeveld T (2006) Approximation results for preemtive stochastic online scheduling. In: ESA\u201906 14th annual European symposium on algorithms","DOI":"10.1007\/11841036_47"},{"issue":"6","key":"10.1007\/s13675-015-0038-7_CR20","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1145\/331524.331530","article-title":"Approximation in stochastic scheduling: the power of lp-based priority schedules","volume":"46","author":"M\u00f6hring","year":"1999","journal-title":"J ACM"},{"key":"10.1007\/s13675-015-0038-7_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou C (1985) Games against nature. J. Comput Syst Sci 31:288\u2013301","DOI":"10.1016\/0022-0000(85)90045-5"},{"issue":"1-2","key":"10.1007\/s13675-015-0038-7_CR22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0304-3975(00)00082-7","article-title":"Game tree algorithms and solution trees","volume":"252","author":"Pijls","year":"2001","journal-title":"Theor Comput Sci"},{"issue":"1","key":"10.1007\/s13675-015-0038-7_CR23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","article-title":"Scenarios and policy aggregation in optimization under uncertainty","volume":"16","author":"Rockafellar","year":"1991","journal-title":"Math Oper Res"},{"key":"10.1007\/s13675-015-0038-7_CR24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01581267","article-title":"Parallel decomposition of multistage stochastic programming problems","volume":"58","author":"Ruszczy\u0144ski","year":"1993","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0038-7_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10107-003-0445-z","article-title":"Stochastic programming with integer variables","volume":"97","author":"Schultz","year":"2003","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0038-7_CR26","doi-asserted-by":"crossref","unstructured":"Subramani K (2004) Analyzing selected quantified integer programs. In: LNAI, vol 3097. Springer, New York, pp 342\u2013356","DOI":"10.1007\/978-3-540-25984-8_26"},{"issue":"1","key":"10.1007\/s13675-015-0038-7_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10472-007-9085-y","article-title":"On a decision procedure for quantified linear programs","volume":"51","author":"Subramani","year":"2007","journal-title":"Ann Math Artif Intell"},{"key":"10.1007\/s13675-015-0038-7_CR28","doi-asserted-by":"crossref","unstructured":"Zhang L, Hermanns H, Eisenbrand F, Jansen D (2008) Flow faster: efficient decision algorithms for probabilistic simulations. Log Methods Comput Sci 4(4)","DOI":"10.2168\/LMCS-4(4:6)2008"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0038-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-015-0038-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0038-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:53Z","timestamp":1761882353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S2192440621000502"],"URL":"https:\/\/doi.org\/10.1007\/s13675-015-0038-7","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving multistage quantified linear optimization problems with the alpha\u2013beta nested Benders decomposition","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-015-0038-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}