{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:22:19Z","timestamp":1761895339219},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_18","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"203-214","source":"Crossref","is-referenced-by-count":10,"title":["Quantified Linear Programs: A Computational Study"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Ederer","sequence":"first","affiliation":[]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Wolf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters\u00a033, 42\u201354 (2005)","journal-title":"Operations Research Letters"},{"key":"18_CR2","unstructured":"Altenstedt, F.: Memory consumption versus computational time in nested benders decomposition for stochastic linear programming. Tech.Rep., Chalmers University, Goteborg (2003)"},{"key":"18_CR3","volume-title":"Dynamic programming","author":"R. Bellmann","year":"1957","unstructured":"Bellmann, R.: Dynamic programming. Princeton University Press, Princeton (1957)"},{"issue":"1","key":"18_CR4","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(1), 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"18_CR5","first-page":"327","volume":"75","author":"J. Birge","year":"1996","unstructured":"Birge, J., Donohue, C., Holmes, D., Svintsitski, O.: A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs. Math. Program.\u00a075, 327\u2013352 (1996)","journal-title":"Math. Program."},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"J. Birge","year":"1988","unstructured":"Birge, J., Louveaux, F.: A multicut algorithm for two-stage stochastic linear programs. European Journal of Operational Research\u00a034(3), 384\u2013392 (1988)","journal-title":"European Journal of Operational Research"},{"key":"18_CR7","volume-title":"Intro. to Stochastic Programming","author":"J. Birge","year":"1997","unstructured":"Birge, J., Louveaux, F.: Intro. to Stochastic Programming. Springer, Heidelberg (1997)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1018996821817","volume":"81","author":"M. Dempster","year":"1998","unstructured":"Dempster, M., Thompson, R.: Parallelization and aggregation ofnested benders decomposition. Annals of Operations Research\u00a081, 163\u2013188 (1998), doi:10.1023\/A:1018996821817","journal-title":"Annals of Operations Research"},{"key":"18_CR9","volume-title":"Proc. of 18th International Parallel & Distributed Processing Symposium (IPDPS),","author":"C. Donninger","year":"2004","unstructured":"Donninger, C., Kure, A., Lorenz, U.: Parallel brutus: The first distributed, fpga accelarated chess program. In: Proc. of 18th International Parallel & Distributed Processing Symposium (IPDPS). IEEE Computer Society, Santa Fe (2004)"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-005-0597-0","volume":"106","author":"M. Dyer","year":"2006","unstructured":"Dyer, M., Stougie, L.: Computational complexity of stochastic programming problems. Math. Program.\u00a0106(3), 423\u2013432 (2006)","journal-title":"Math. Program."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Engell, S., M\u00e4rkert, A., Sand, G., Schultz, R.: Aggregated scheduling of a multiproduct batch plant by two-stage stochastic integer programming. Optimiz. and Engineering\u00a05 (2004)","DOI":"10.1023\/B:OPTE.0000038890.51798.5a"},{"issue":"1-3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01580872","volume":"47","author":"H. Gassmann","year":"1990","unstructured":"Gassmann, H.: Mslip: A computer code for the multistage stochastic linear programming problem. Mathematical Programming\u00a047(1-3), 407\u2013423 (1990)","journal-title":"Mathematical Programming"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/264029.264031","volume":"23","author":"J. Ho","year":"1997","unstructured":"Ho, J., Sundarraj, R.P.: Distributed nested decomposition of staircase linear programs. ACM Trans. Math. Softw.\u00a023, 148\u2013173 (1997)","journal-title":"ACM Trans. Math. Softw."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"K\u0131l\u0131n\u00e7 Karzan, F., Nemhauser, G., Savelsbergh, M.: Information-based branching schemes for binary linear mixed integer problems. Mathematical Programming Computation (January 2010)","DOI":"10.1007\/s12532-009-0009-1"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Kleywegt, A., Shapiro, A., Homem-De-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM Jour. of Opt., 479\u2013502 (2001)","DOI":"10.1137\/S1052623499363220"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-540-75520-3_64","volume-title":"Algorithms \u2013 ESA 2007","author":"F.G. K\u00f6nig","year":"2007","unstructured":"K\u00f6nig, F.G., L\u00fcbbecke, M., M\u00f6hring, R.H., Sch\u00e4fer, G., Spenke, I.: Solutions to real-world instances of PSPACE-complete stacking. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 729\u2013740. Springer, Heidelberg (2007)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. Robust and online large-scale optimization, 1\u201327 (2009)","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-15775-2_44","volume-title":"Algorithms \u2013 ESA 2010","author":"U. Lorenz","year":"2010","unstructured":"Lorenz, U., Martin, A., Wolf, J.: Polyhedral and algorithmic properties of quantified linear programs. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 512\u2013523. Springer, Heidelberg (2010)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/11841036_47","volume-title":"Algorithms \u2013 ESA 2006","author":"N. Megow","year":"2006","unstructured":"Megow, N., Vredeveld, T.: Approximation in preemptive stochastic online scheduling. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 516\u2013527. Springer, Heidelberg (2006)"},{"issue":"6","key":"18_CR20","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"R. M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R., Schulz, A., Uetz, M.: Approximation in stochastic scheduling: The power of lp-based priority schedules. Journal of ACM\u00a046(6), 924\u2013942 (1999)","journal-title":"Journal of ACM"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-72792-7_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.P. Ostrowski","year":"2007","unstructured":"Ostrowski, J.P., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 104\u2013118. Springer, Heidelberg (2007)"},{"key":"18_CR22","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Production planning by mixed integer programming","author":"Y. Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.: Production planning by mixed integer programming. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2008.10.033","volume":"199","author":"C. Poojari","year":"2009","unstructured":"Poojari, C., Beasley, J.: Improving benders decomposition using a genetic algorithm. European Journal of Operational Research\u00a0199(1), 89\u201397 (2009)","journal-title":"European Journal of Operational Research"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"R.T. Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.-B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res.\u00a016, 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01581267","volume":"58","author":"A. Ruszczy\u0144ski","year":"1993","unstructured":"Ruszczy\u0144ski, A.: Parallel decomposition of multistage stochastic programming problems. Math. Program.\u00a058, 201\u2013228 (1993)","journal-title":"Math. Program."},{"key":"18_CR26","first-page":"333","volume":"79","author":"A. Ruszczy\u0144ski","year":"1997","unstructured":"Ruszczy\u0144ski, A.: Decomposition methods in stochastic programming. Math. Program.\u00a079, 333\u2013353 (1997)","journal-title":"Math. Program."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-003-0445-z","volume":"97","author":"R. Schultz","year":"2003","unstructured":"Schultz, R.: Stochastic programming with integer variables. Math. Progr.\u00a097, 285\u2013309 (2003)","journal-title":"Math. Progr."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: Proc. FOCS 2004, pp. 228\u2013237 (2004)","DOI":"10.1109\/FOCS.2004.62"},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TPWRS.2007.901092","volume":"22","author":"J. Sirikum","year":"2007","unstructured":"Sirikum, J., Techanitisawad, A., Kachitvichyanukul, V.: A new efficient GA-benders\u2019 decomposition method: For power generation expansion planning with emission controls. IEEE Transactions on Power Systems\u00a022(3), 1092\u20131100 (2007)","journal-title":"IEEE Transactions on Power Systems"},{"key":"18_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-25984-8_26","volume-title":"Automated Reasoning","author":"K. Subramani","year":"2004","unstructured":"Subramani, K.: Analyzing selected quantified integer programs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 342\u2013356. Springer, Heidelberg (2004)"},{"issue":"1","key":"18_CR31","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10472-007-9085-y","volume":"51","author":"K. Subramani","year":"2007","unstructured":"Subramani, K.: On a decision procedure for quantified linear programs. Annals of Mathematics and Artificial Intelligence\u00a051(1), 55\u201377 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"4","key":"18_CR32","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R.M. Slyke Van","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics\u00a017(4), 638\u2013663 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"18_CR33","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. Comput. Optim. Appl.\u00a024, 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.: Flow faster: Efficient decision algorithms for probabilistic simulations. Logical Methods in Computer Science\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:6)2008"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:08:40Z","timestamp":1560528520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}