{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:48:35Z","timestamp":1794340115915,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343066","type":"print"},{"value":"9783540343073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_12","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T03:59:15Z","timestamp":1148011155000},"page":"126-138","source":"Crossref","is-referenced-by-count":0,"title":["Plan B: Uncertainty\/Time Trade-Offs for Linear and Integer Programming"],"prefix":"10.1007","author":[{"given":"Claire","family":"Kenyon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Althoefer, I., Berger, F., Schwarz, S.: Generating True Alternatives with a Penalty Method (2002), http:\/\/www.minet.uni-jena.de\/MathNet\/reports\/shadows\/02-04report.html"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A. Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust Optimization - Methodology and Applications. Mathematical Programming Series B\u00a092, 453\u2013480 (2002)","journal-title":"Mathematical Programming Series B"},{"key":"12_CR3","volume-title":"Introduction to Stochastic Programming","author":"J. Birge","year":"1997","unstructured":"Birge, J., Louveaux, F.: Introduction to Stochastic Programming. Springer, Heidelberg (1997)"},{"key":"12_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","volume":"51","author":"J.W. Chinneck","year":"2000","unstructured":"Chinneck, J.W., Ramadan, K.: Linear programming with interval coefficients. Journal of the Operational Research Society\u00a051(2), 209\u2013220 (2000)","journal-title":"Journal of the Operational Research Society"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11493853_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"K. Elbassioni","year":"2005","unstructured":"Elbassioni, K., Katriel, I.: Multiconsistency and Robustness with Global Constraints. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 168\u2013182. Springer, Heidelberg (2005)"},{"key":"12_CR7","unstructured":"Eppstein, D.: Bibliography on k shortest paths and other \u201dk best solutions\u201d problems (2001), http:\/\/www.ics.uci.edu\/~eppstein\/-bibs\/-kpath.bib"},{"key":"12_CR8","unstructured":"Guestrin, C., Koller, D., Gearhart, C., Kanodia, N.: Generalizing Plans to New Environments in Relational MDPs. In: IJCAI (2003)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-24664-0_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E. Hebrard","year":"2004","unstructured":"Hebrard, E., Hnich, B., Walsh, T.: Super Solutions in Constraint Programming. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 157\u2013172. Springer, Heidelberg (2004)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Hulgeri, A., Sudarshan, S.: Parametric Query Optimization for Linear and Piecewise Linear Cost Functions. In: VLDB, pp. 167\u2013178 (2002)","DOI":"10.1016\/B978-155860869-6\/50023-8"},{"key":"12_CR11","first-page":"1107","volume":"4","author":"M. Lagoudakis","year":"2003","unstructured":"Lagoudakis, M., Parr, R.: Least-Squares Policy Iteration. Journal of Machine Learning Research\u00a04, 1107\u20131149 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"12_CR12","unstructured":"Sameith, I.: On the Generation of Alternative Solutions for Discrete Optimization Problems with Uncertain Data (2004), http:\/\/www.minet.uni-jena.de\/MathNet\/reports\/shadows\/04-01report.html"},{"issue":"2-3","key":"12_CR13","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., Nemhauser, G., Shapiro, A.: The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study. Computational Optimization and Applications\u00a024(2-3), 289\u2013333 (2003)","journal-title":"Computational Optimization and Applications"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Vossen, T., Ball, M., Lotem, A., Nau, D.S.: On the Use of Integer Programming Models in AI Planning. In: IJCAI (1999)","DOI":"10.1017\/S0269888900001065"},{"key":"12_CR15","unstructured":"Yorke-Smith, N.: Reliable Constraint Reasoning with Uncertain Data. PhD thesis, IC-Parc, Imperial College London (June 2004)"},{"key":"12_CR16","unstructured":"Yorke-Smith, N., Gervet, C.: Tight and Tractable Reformulations for Uncertain CSPs. In: Proceedings of CP 2004 Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Toronto, Canada (September 2004)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T09:09:06Z","timestamp":1683450546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11757375_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11757375","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}