{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:03:49Z","timestamp":1743141829062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030891879"},{"type":"electronic","value":"9783030891886"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89188-6_36","type":"book-chapter","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:23Z","timestamp":1635112943000},"page":"485-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Relaxations for Multistage Robust Optimization"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hartisch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"issue":"1","key":"36_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. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Akl, S., Newborn, M.: The principal continuation and the killer heuristic. In: Proceedings of the 1977 annual conference, ACM 1977, pp. 466\u2013473. Seattle, Washington, USA (1977)","DOI":"10.1145\/800179.810240"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-45586-8_2","volume-title":"Computational Combinatorial Optimization","author":"E Balas","year":"2001","unstructured":"Balas, E.: Projection and lifting in combinatorial optimization. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, pp. 26\u201356. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45586-8_2"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)","DOI":"10.1515\/9781400831050"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1287\/opre.2016.1515","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., Dunning, I.: Multistage robust mixed-integer optimization with adaptive partitions. Oper. Res. 64(4), 980\u2013998 (2016)","journal-title":"Oper. Res."},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1287\/opre.2015.1365","volume":"63","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., Georghiou, A.: Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 63(3), 610\u2013627 (2015)","journal-title":"Oper. Res."},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate quantified boolean formulae and its experimental evaluation. J. Autom. Reasoning 28(2), 101\u2013142 (2002)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"36_CR8","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_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01581105","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Cordier, C., Marchand, H., Wolsey, L.A.: Cutting planes for integer programs with general integer variables. Math. Program. 81(2), 201\u2013214 (1998)","journal-title":"Math. Program."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1613\/jair.788","volume":"14","author":"X Chen","year":"2001","unstructured":"Chen, X., Van Beek, P.: Conflict-directed backjumping revisited. J. Artif. Intell. Res. 14, 53\u201381 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Delage, E., Iancu, D.A.: Robust multistage decision making. In: The operations research revolution, pp. 20\u201346. INFORMS (2015)","DOI":"10.1287\/educ.2015.0139"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/978-3-540-30117-2_101","volume-title":"Field Programmable Logic and Application","author":"C Donninger","year":"2004","unstructured":"Donninger, C., Lorenz, U.: The chess monster hydra. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 927\u2013932. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30117-2_101"},{"key":"36_CR13","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_CR14","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","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":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(02)00373-9","volume":"145","author":"E Giunchiglia","year":"2003","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Backjumping for quantified boolean logic satisfiability. Artif. Intell. 145(1), 99\u2013120 (2003)","journal-title":"Artif. Intell."},{"key":"36_CR16","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A., et al.: Learning for quantified boolean logic satisfiability. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 649\u2013654 (2002)"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"105434","DOI":"10.1016\/j.cor.2021.105434","volume":"135","author":"M Goerigk","year":"2021","unstructured":"Goerigk, M., Hartisch, M.: Multistage robust discrete optimization via quantified integer programming. Comput. Oper. Res. 135, 105434 (2021)","journal-title":"Comput. Oper. Res."},{"key":"36_CR18","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 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"36_CR19","doi-asserted-by":"publisher","unstructured":"Hartisch, M.: Quantified Integer Programming with Polyhedral and Decision-Dependent Uncertainty. Ph.D. thesis, University of Siegen, Germany (2020). https:\/\/doi.org\/10.25819\/ubsi\/4841","DOI":"10.25819\/ubsi\/4841"},{"key":"36_CR20","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_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-030-29908-8_36","volume-title":"PRICAI 2019: Trends in Artificial Intelligence","author":"M Hartisch","year":"2019","unstructured":"Hartisch, M., Lorenz, U.: Mastering uncertainty: towards robust multistage optimization with decision dependent uncertainty. In: Nayak, A.C., Sharma, A. (eds.) PRICAI 2019. LNCS (LNAI), vol. 11670, pp. 446\u2013458. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29908-8_36"},{"key":"36_CR22","doi-asserted-by":"publisher","unstructured":"Hartisch, M., Lorenz, U.: A novel application for game tree search - exploiting pruning mechanisms for quantified integer programs. In: Cazenave, T., van den Herik, J., Saffidine, A., Wu, I.C. (eds.) Advances in Computer Games. ACG 2019. Lecture Notes in Computer Science, vol. 12516, pp. 66\u201378. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65883-0_6","DOI":"10.1007\/978-3-030-65883-0_6"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Hemmi, D., Tack, G., Wallace, M.: A recursive scenario decomposition algorithm for combinatorial multistage stochastic optimisation problems. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11525"},{"key":"36_CR24","unstructured":"Huang, J., et al.: The effect of restarts on the efficiency of clause learning. In: IJCAI, vol. 7, pp. 2318\u20132323 (2007)"},{"key":"36_CR25","doi-asserted-by":"publisher","unstructured":"Kall, P., Mayer, J.: Stochastic Linear Programming. Models, Theory and Computation. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/b105472","DOI":"10.1007\/b105472"},{"issue":"4","key":"36_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D Knuth","year":"1975","unstructured":"Knuth, D., Moore, R.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"36_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3233\/SAT190077","volume":"7","author":"F Lonsing","year":"2010","unstructured":"Lonsing, F., Biere, A.: DepQBF: a dependency-aware QBF solver. J. Satisfiability Boolean Model. Comput. 7(2\u20133), 71\u201376 (2010)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"issue":"4","key":"36_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s13675-015-0038-7","volume":"3","author":"U Lorenz","year":"2015","unstructured":"Lorenz, U., Wolf, J.: Solving multistage quantified linear optimization problems with the alpha-beta nested benders decomposition. EURO J. Comput. Optim. 3(4), 349\u2013370 (2015)","journal-title":"EURO J. Comput. Optim."},{"key":"36_CR29","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, pp. 131\u2013153. IOS Press (2009)"},{"key":"36_CR30","unstructured":"Mercier, L., Van Hentenryck, P.: Performance analysis of online anticipatory algorithms for large multistage stochastic integer programs. In: IJCAI, pp. 1979\u20131984 (2007)"},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"2","key":"36_CR32","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."},{"key":"36_CR33","unstructured":"Pearl, J.: Scout: A simple game-searching algorithm with proven optimal properties. In: Proceedings of the First AAAI Conference on Artificial Intelligence, AAAI 1980, pp. 143\u2013145. AAAI Press (1980)"},{"issue":"1","key":"36_CR34","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. Theor. Comput. Sci. 252(1), 197\u2013215 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"36_CR35","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J Schaeffer","year":"1989","unstructured":"Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Trans. Pattern Anal. Mach. Intell. 11(11), 1203\u20131212 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"36_CR36","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.orl.2011.01.001","volume":"39","author":"A Shapiro","year":"2011","unstructured":"Shapiro, A.: A dynamic programming approach to adjustable robust optimization. Oper. Res. Lett. 39(2), 83\u201387 (2011)","journal-title":"Oper. Res. Lett."},{"key":"36_CR37","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":"1","key":"36_CR38","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10107-003-0373-y","volume":"99","author":"S Takriti","year":"2004","unstructured":"Takriti, S., Ahmed, S.: On robust optimization of two-stage systems. Math. Program. 99(1), 109\u2013126 (2004)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2021: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89188-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T15:53:41Z","timestamp":1673625221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89188-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891879","9783030891886"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89188-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 October 2021","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":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"382","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}