{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T05:13:17Z","timestamp":1738300397888,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681540"},{"type":"electronic","value":"9783540681557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68155-7_15","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T09:41:20Z","timestamp":1211190080000},"page":"173-187","source":"Crossref","is-referenced-by-count":8,"title":["Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Luc","family":"Mercier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","volume":"72","author":"A.G. Barto","year":"1995","unstructured":"Barto, A.G., Bradtke, S.J., Singh, S.P.: Learning to act using real-time dynamic programming. Artificial Intelligence\u00a072(1), 81\u2013138 (1995)","journal-title":"Artificial Intelligence"},{"key":"15_CR2","unstructured":"Bent, R., Van Hentenryck, P.: Waiting and Relocation Strategies in Online Stochastic Vehicle Routing. In: Proceedings of the 20th Int. Joint Conf. on A.I. (IJCAI 2007) (January 2007)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bent, R., Van Hentenryck, P.: Scenario-Based Planning for Partially Dynamic Vehicle Routing Problems with Stochastic Customers. Operations Research 52(6) (2004)","DOI":"10.1287\/opre.1040.0124"},{"key":"15_CR4","unstructured":"Bonet, B., Geffner, H.: Faster heuristic search algorithms for planning with uncertainty and full feedback. In: IJCAI, pp. 1233\u20131238 (2003)"},{"key":"15_CR5","unstructured":"Bonet, B., Geffner, H.: Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to mdps. In: ICAPS (2006)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Choi, J., Realff, M.J., Lee, J.H.: Dynamic prog. in a heuristically confined state space: A stochastic resource-constrained project scheduling appplication. Computers and Chemical Engineering (2004)","DOI":"10.1016\/j.compchemeng.2003.09.024"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1007\/s10958-006-0058-1","volume":"133","author":"M.A.H. Dempster","year":"2006","unstructured":"Dempster, M.A.H.: Sequential Importance Sampling Algorithms for Dynamic Stochastic Programming. Journal of Mathematical Sciences\u00a0133, 1422\u20131444 (2006)","journal-title":"Journal of Mathematical Sciences"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dooms, G., Van Hentenryck, P.: Gap Reduction Techniques for Online Stochastic Project Scheduling. In: CPAIOR 2008 (2008)","DOI":"10.1007\/978-3-540-68155-7_8"},{"key":"15_CR9","unstructured":"Dupacova, J., Consigli, G., Wallace, S.W.: Scenarios for multistage stochastic programs. Annals of Operations Research (2000)"},{"issue":"2-3","key":"15_CR10","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.E.: A class of stochastic programs with decision dependent uncertainty. Math. Program\u00a0108(2-3), 355\u2013394 (2006)","journal-title":"Math. Program"},{"issue":"1-2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(01)00106-0","volume":"129","author":"E.A. Hansen","year":"2001","unstructured":"Hansen, E.A., Zilberstein, S.: LAO: A heuristic-search algorithm that finds solutions with loops. Artificial Intelligence\u00a0129(1-2), 35\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"15_CR12","unstructured":"Kearns, M., Mansour, Y., Ng, A.: A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes. In: IJCAI 1999, pp. 1231\u20131324 (1999)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"McMahan, H.B., Likhachev, M., Gordon, G.J.: Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In: ICML, pp. 569\u2013576 (2005)","DOI":"10.1145\/1102351.1102423"},{"key":"15_CR14","unstructured":"Mercier, L., Van Hentenryck, P.: Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Programs. In: Proceedings of the 20th Int. Joint Conf. on AI (IJCAI) (2007)"},{"key":"15_CR15","unstructured":"Parkes, D., Duong, A.: An Ironing-Based Approach to Adaptive Online Mechanism Design in Single-Valued Domains. In: AAAI 2007, Vancouver, Canada, pp. 94\u2013101 (2007)"},{"key":"15_CR16","series-title":"Hanbooks in Operations Research and Management Series","volume-title":"Stochastic Programming","year":"2003","unstructured":"Ruszczynski, A., Shapiro, A. (eds.): Stochastic Programming. Hanbooks in Operations Research and Management Series, vol.\u00a010. Elsevier, Amsterdam (2003)"},{"key":"15_CR17","unstructured":"Thomas, M., Szczerbicka, H.: Evaluating Online Scheduling Techniques in Uncertain Environments. In: Proceedings of the 3rd Multidisciplinary International Scheduling Conference (MISTA 2007) (2007)"},{"key":"15_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5140.001.0001","volume-title":"Online Stochastic Combinatorial Optimization","author":"P. Hentenryck Van","year":"2006","unstructured":"Van Hentenryck, P., Bent, R.: Online Stochastic Combinatorial Optimization. The MIT Press, Cambridge (2006)"}],"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\/978-3-540-68155-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T10:09:34Z","timestamp":1738231774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540681540","9783540681557"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}