{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:25Z","timestamp":1758273865251,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030299071"},{"type":"electronic","value":"9783030299088"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29908-8_36","type":"book-chapter","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T01:03:32Z","timestamp":1566522212000},"page":"446-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Mastering Uncertainty: Towards Robust Multistage Optimization with Decision Dependent Uncertainty"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hartisch","sequence":"first","affiliation":[]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,23]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.compchemeng.2016.11.011","volume":"103","author":"R Apap","year":"2017","unstructured":"Apap, R., Grossmann, I.: Models and computational strategies for multistage stochastic programming under endogenous and exogenous uncertainties. Comput. Chem. Eng. 103, 233\u2013274 (2017)","journal-title":"Comput. Chem. Eng."},{"key":"36_CR2","volume-title":"Dynamic Programming","author":"R Bellman","year":"2003","unstructured":"Bellman, R.: Dynamic Programming. Dover Publications, New York (2003)"},{"key":"36_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"36_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"J Birge","year":"2011","unstructured":"Birge, J., Louveaux, F.: Introduction to Stochastic Programming, 2nd edn. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-0237-4","edition":"2"},{"issue":"4","key":"36_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","volume":"20","author":"M Campbell","year":"1983","unstructured":"Campbell, M., Marsland, T.: A comparison of minimax tree search algorithms. Artif. Intell. 20(4), 347\u2013367 (1983)","journal-title":"Artif. Intell."},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1145\/103516.128681","volume":"38","author":"A Condon","year":"1991","unstructured":"Condon, A.: Space-bounded probabilistic game automata. J. ACM 38(2), 472\u2013494 (1991)","journal-title":"J. ACM"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"De Filippo, A., Lombardi, M., Milano, M.: Methods for off-line\/on-line optimization under uncertainty. In: IJCAI, pp. 1270\u20131276 (2018)","DOI":"10.24963\/ijcai.2018\/177"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-71649-7_19","volume-title":"Advances in Computer Games","author":"T Ederer","year":"2017","unstructured":"Ederer, T., Hartisch, M., Lorenz, U., Opfer, T., Wolf, J.: Yasol: an open source solver for quantified mixed integer programs. In: Winands, M.H.M., van den Herik, H.J., Kosters, W.A. (eds.) ACG 2017. LNCS, vol. 10664, pp. 224\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71649-7_19"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-23719-5_18","volume-title":"Algorithms \u2013 ESA 2011","author":"T Ederer","year":"2011","unstructured":"Ederer, T., Lorenz, U., Martin, A., Wolf, J.: Quantified linear programs: a computational study. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 203\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_18"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/12.372041","volume":"44","author":"R Gerber","year":"1995","unstructured":"Gerber, R., Pugh, W., Saksena, M.: Parametric dispatching of hard real-time tasks. IEEE Trans. Comput. 44(3), 471\u2013479 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"36_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-006-0715-7","volume":"108","author":"V Goel","year":"2006","unstructured":"Goel, V., Grossmann, I.: A class of stochastic programs with decision dependent uncertainty. Math. Program. 108(2), 355\u2013394 (2006)","journal-title":"Math. Program."},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2004, pp. 417\u2013426. ACM, New York (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.compchemeng.2013.11.011","volume":"62","author":"V Gupta","year":"2014","unstructured":"Gupta, V., Grossmann, I.: A new decomposition algorithm for multistage stochastic programs with endogenous uncertainties. Comput. Chem. Eng. 62, 62\u201379 (2014)","journal-title":"Comput. Chem. Eng."},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-50935-8_15","volume-title":"Computers and Games","author":"M Hartisch","year":"2016","unstructured":"Hartisch, M., Ederer, T., Lorenz, U., Wolf, J.: Quantified integer programs with polyhedral uncertainty set. In: Plaat, A., Kosters, W., van den Herik, J. (eds.) CG 2016. LNCS, vol. 10068, pp. 156\u2013166. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50935-8_15"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1018943626786","volume":"82","author":"T Jonsbr\u00e5ten","year":"1998","unstructured":"Jonsbr\u00e5ten, T., Wets, R.J.B., Woodruff, D.: A class of stochastic programs withdecision dependent random elements. Ann. Oper. Res. 82, 83\u2013106 (1998)","journal-title":"Ann. Oper. Res."},{"key":"36_CR17","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":"FG K\u00f6nig","year":"2007","unstructured":"K\u00f6nig, F.G., L\u00fcbbecke, M., M\u00f6hring, R., 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. 4698, pp. 729\u2013740. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_64"},{"issue":"5","key":"36_CR18","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1002\/aic.15183","volume":"62","author":"N Lappas","year":"2016","unstructured":"Lappas, N., Gounaris, C.: Multi-stage adjustable robust optimization for process scheduling under uncertainty. AIChE J. 62(5), 1646\u20131667 (2016)","journal-title":"AIChE J."},{"key":"36_CR19","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. 6346, pp. 512\u2013523. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_44"},{"issue":"2","key":"36_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/24725579.2017.1296907","volume":"7","author":"O Nohadani","year":"2017","unstructured":"Nohadani, O., Roy, A.: Robust optimization with time-dependent uncertainty in radiation therapy. IISE Trans. Healthc. Syst. Eng. 7(2), 81\u201392 (2017)","journal-title":"IISE Trans. Healthc. Syst. Eng."},{"issue":"2","key":"36_CR21","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.: Games against nature. J. Comput. Syst. Sci. 31(2), 288\u2013301 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"36_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(00)00082-7","volume":"252","author":"W Pijls","year":"2001","unstructured":"Pijls, W., de Bruin, A.: Game tree algorithms and solution trees. Theoret. Comput. Sci. 252(1), 197\u2013215 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"36_CR23","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1016\/j.ejor.2014.02.060","volume":"237","author":"M Poss","year":"2014","unstructured":"Poss, M.: Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237(3), 836\u2013845 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR24","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"36_CR25","series-title":"Lecture Notes in Computer Science (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. 3097, pp. 342\u2013356. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25984-8_26"},{"issue":"3","key":"36_CR26","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s10957-016-0920-3","volume":"171","author":"R Vujanic","year":"2016","unstructured":"Vujanic, R., Goulart, P., Morari, M.: Robust optimization of schedules affected by uncertain events. J. Optim. Theory Appl. 171(3), 1033\u20131054 (2016)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2019: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29908-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:23:09Z","timestamp":1709824989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29908-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299071","9783030299088"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29908-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuvu, Yanuka Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fiji","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}