{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:39:31Z","timestamp":1725935971191},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319716480"},{"type":"electronic","value":"9783319716497"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-71649-7_19","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T13:46:24Z","timestamp":1513863984000},"page":"224-233","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Yasol: An Open Source Solver for Quantified Mixed Integer Programs"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Ederer","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hartisch","sequence":"additional","affiliation":[]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Opfer","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Wolf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"19_CR1","unstructured":"Achterberg, T.: Constraint integer programming. PhD thesis, Berlin (2007)"},{"key":"19_CR2","unstructured":"Bellmann, R.: Dynamic Programming. Princeton University Press (1957)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)","DOI":"10.1515\/9781400831050"},{"key":"19_CR4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Springer Series in Operations Research and Financial Engineering (1997)"},{"key":"19_CR5","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"},{"key":"19_CR6","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-28697-6_52","volume-title":"Operations Research Proceedings 2014","author":"T Ederer","year":"2016","unstructured":"Ederer, T., Lorenz, U., Opfer, T., Wolf, J.: Multistage optimization with the help of quantified linear programming. In: L\u00fcbbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds.) Operations Research Proceedings 2014. ORP, pp. 369\u2013375. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28697-6_52"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-31866-5_23","volume-title":"Advances in Computer Games","author":"T Ederer","year":"2012","unstructured":"Ederer, T., Lorenz, U., Opfer, T., Wolf, J.: Modeling games with the help of quantified integer linear programs. In: Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 270\u2013281. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31866-5_23"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Feldmann, R.: Game tree search on massively parallel systems. Ph.D. thesis, University of Paderborn (1993)","DOI":"10.1007\/3-540-55488-2_32"},{"key":"19_CR9","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, Aske, Kosters, Walter, van den Herik, Jaap (eds.) CG 2016. LNCS, vol. 10068, pp. 156\u2013166. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50935-8_15"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(80)90053-0","volume":"2","author":"E Johnson","year":"1980","unstructured":"Johnson, E., Suhl, U.: Experiments in integer programming. Discret. Appl. Math. 2, 39\u201355 (1980)","journal-title":"Discret. Appl. Math."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A Kleywegt","year":"2001","unstructured":"Kleywegt, A., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12, 479\u2013502 (2001)","journal-title":"SIAM J. Optim."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, F., L\u00fcbbecke, M., M\u00f6hring, R., Sch\u00e4fer, G., Spenke, I.: Solutions to real-world instances of PSPACE-complete stacking. In: Proceedings European Symposium on Algorithms (ESA\u201907). LNCS 4698, Springer (2007) 729\u2013740","DOI":"10.1007\/978-3-540-75520-3_64"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-05465-5_1","volume-title":"Robust and Online Large-Scale Optimization","author":"C Liebchen","year":"2009","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R., Stiller, S.: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 1\u201327. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05465-5_1"},{"key":"19_CR14","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: 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"},{"key":"19_CR15","unstructured":"Megow, N., Vredeveld, T.: Approximation results for preemptive stochastic online scheduling. In: Proceedings European Symposium on Algorithms (ESA\u201906). LNCS 4168, Springer (2006) 516\u2013527"},{"key":"19_CR16","doi-asserted-by":"crossref","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 the ACM 46, 924\u2013942 (1999)","journal-title":"Journal of the ACM"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.: Games against nature. Journal of Computer and System Sciences 31, 288\u2013301 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR18","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons Inc, New York (1986)"},{"key":"19_CR19","doi-asserted-by":"crossref","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 51, 55\u201377 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"19_CR20","unstructured":"Wolf, J.: Quantified Linear Programming. PhD Thesis, Darmstadt University of Technology (2015)"},{"key":"19_CR21","unstructured":"Zhang, L.: Searching for Truth: Techniques for Satisfiability of Boolean Formulas. PhD thesis, Princeton University (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71649-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T20:29:16Z","timestamp":1660163356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71649-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319716480","9783319716497"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71649-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}