{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:19:11Z","timestamp":1761895151486},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_44","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"512-523","source":"Crossref","is-referenced-by-count":10,"title":["Polyhedral and Algorithmic Properties of Quantified Linear Programs"],"prefix":"10.1007","author":[{"given":"U.","family":"Lorenz","sequence":"first","affiliation":[]},{"given":"A.","family":"Martin","sequence":"additional","affiliation":[]},{"given":"J.","family":"Wolf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Altenstedt, F.: Memory consumption versus computational time in nested benders decomposition for stochastic linear programming. Tech. Rep., Chalmers University, Goteborg (2003)"},{"key":"44_CR2","volume-title":"Dynamic programming","author":"R. Bellmann","year":"1957","unstructured":"Bellmann, R.: Dynamic programming. Princeton University Press, Princeton (1957)"},{"key":"44_CR3","volume-title":"Intro. to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Intro. to Stochastic Programming. Springer, Heidelberg (1997)"},{"key":"44_CR4","doi-asserted-by":"crossref","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), Santa Fe. IEEE Computer Society, Los Alamitos (2004)","DOI":"10.1109\/IPDPS.2004.1302962"},{"issue":"3","key":"44_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-005-0597-0","volume":"106","author":"M.E. Dyer","year":"2006","unstructured":"Dyer, M.E., Stougie, L.: Computational complexity of stochastic programming problems. Math. Program.\u00a0106(3), 423\u2013432 (2006)","journal-title":"Math. Program."},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70575-8_21","volume-title":"Automata, Languages and Programming","author":"F. Eisenbrand","year":"2008","unstructured":"Eisenbrand, F., Rothvo\u00df, T.: A ptas for static priority real-time scheduling with resource augmentation. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Engell, S., M\u00e4rkert, A.M., 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"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02094-0_8","volume-title":"Algorithmics of Large and Complex Networks","author":"S. Grothklags","year":"2009","unstructured":"Grothklags, S., Lorenz, U., Monien, B.: From state-of-the-art static fleet assignment to flexible stochastic planning of the future. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 140\u2013165. Springer, Heidelberg (2009)"},{"key":"44_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS (1997)","DOI":"10.1145\/261342.571216"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Kleywegt, A.J., 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":"44_CR12","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.E., 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":"44_CR13","doi-asserted-by":"crossref","unstructured":"Liebchen, C., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Robust and online large-scale optimization, pp. 1\u201327 (2009)","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"44_CR14","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 results for preemtive stochastic online scheduling. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 516\u2013527. Springer, Heidelberg (2006)"},{"issue":"6","key":"44_CR15","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"R.H. M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R.H., Schulz, A.S., 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":"44_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Games against nature. J. of Comp. and Sys. Sc, 288\u2013301 (1985)","DOI":"10.1016\/0022-0000(85)90045-5"},{"key":"44_CR17","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.A.: Production planning by mixed integer programming. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"key":"44_CR18","doi-asserted-by":"crossref","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":"44_CR19","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., 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"},{"key":"44_CR20","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":"44_CR21","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"},{"key":"44_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: 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 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:18:20Z","timestamp":1559506700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}