{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:19:47Z","timestamp":1761895187925,"version":"3.38.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T00:00:00Z","timestamp":1288656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-010-0798-7","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T15:45:31Z","timestamp":1288712731000},"page":"233-271","source":"Crossref","is-referenced-by-count":17,"title":["An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization"],"prefix":"10.1007","volume":"184","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","published-online":{"date-parts":[[2010,11,2]]},"reference":[{"issue":"1","key":"798_CR1","doi-asserted-by":"crossref","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. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1), 81\u2013138.","journal-title":"Artificial Intelligence"},{"key":"798_CR2","volume-title":"CP\u201901","author":"T. Benoist","year":"2001","unstructured":"Benoist, T., Bourreau, E., Caseau, Y., & Rottembourg, B. (2001). Towards stochastic constraint programming: a study of online multi-choice Knapsack with deadlines. In: CP\u201901."},{"issue":"6","key":"798_CR3","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"R. Bent","year":"2004","unstructured":"Bent, R., & Van Hentenryck, P. (2004). Scenario based planning for partially dynamic vehicle routing problems with stochastic customers. Operations Research, 52(6), 977\u2013987.","journal-title":"Operations Research"},{"key":"798_CR4","volume-title":"IJCAI\u20192007","author":"R. Bent","year":"2007","unstructured":"Bent, R., & Van Hentenryck, P. (2007). Waiting and relocation strategies in online stochastic vehicle routing. In: IJCAI\u20192007."},{"key":"798_CR5","volume-title":"IJCAI\u20192003","author":"B. Bonet","year":"2003","unstructured":"Bonet, B., & Geffner, H. (2003). Faster heuristic search algorithms for planning with uncertainty and full feedback. In: IJCAI\u20192003."},{"key":"798_CR6","volume-title":"ICAPS\u20192006","author":"B. Bonet","year":"2006","unstructured":"Bonet, B., & Geffner, H. (2006). Learning depth-first search: a unified approach to heuristic search in deterministic and non-deterministic settings, and its application to mdps. In: ICAPS\u20192006."},{"key":"798_CR7","volume-title":"AIPS\u201900","author":"H. Chang","year":"2000","unstructured":"Chang, H., Givan, R., & Chong, E. (2000). Online scheduling via sampling. In: AIPS\u201900."},{"issue":"6\u20137","key":"798_CR8","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.compchemeng.2003.09.024","volume":"28","author":"J. Choi","year":"2004","unstructured":"Choi, J., Realff, M. J., & Lee, J. H. (2004). Dynamic programming in a heuristically confined state space: a\u00a0stochastic resource-constrained project scheduling appplication. Computers and Chemical Engineering, 28(6\u20137), 1039\u20131058.","journal-title":"Computers and Chemical Engineering"},{"key":"798_CR9","first-page":"1422","volume":"84","author":"M. A. H. Dempster","year":"1998","unstructured":"Dempster, M. A. H. (1998). Sequential importance sampling algorithms for dynamic stochastic programming. Annals of Operations Research, 84, 1422\u20131444.","journal-title":"Annals of Operations Research"},{"key":"798_CR10","volume-title":"CPAIOR\u201908","author":"G. Dooms","year":"2008","unstructured":"Dooms, G., & Van Hentenryck, P. (2008). Gap reduction techniques for online stochastic project scheduling. In: CPAIOR\u201908."},{"issue":"1\u20134","key":"798_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"J. Dupacova","year":"2000","unstructured":"Dupacova, J., Consigli, G., & Wallace, S. W. (2000). Scenarios for multistage stochastic programs. Annals of Operations Research, 100(1\u20134), 25\u201353.","journal-title":"Annals of Operations Research"},{"key":"798_CR12","unstructured":"Dupacova, J., Groewe-Kuska, N., & Roemisch, W. (2003). Scenario reduction in stochastic programming: an approach using probability metrics. Mathematical Programming, Ser. A, 95(4)."},{"issue":"2\u20133","key":"798_CR13","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10107-006-0715-7","volume":"108","author":"V. Goel","year":"2006","unstructured":"Goel, V., & Grossmann, I. E. (2006). A class of stochastic programs with decision dependent uncertainty. Mathematical Programming, 108(2\u20133), 355\u2013394.","journal-title":"Mathematical Programming"},{"issue":"1\u20132","key":"798_CR14","doi-asserted-by":"crossref","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. (2001). LAO: a heuristic-search algorithm that finds solutions with loops. Artificial Intelligence, 129(1\u20132), 35\u201362.","journal-title":"Artificial Intelligence"},{"key":"798_CR15","volume-title":"IJCAI\u20191999","author":"M. Kearns","year":"1999","unstructured":"Kearns, M., Mansour, Y., & Ng, A. (1999). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. In: IJCAI\u20191999."},{"key":"798_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"W. K. Mak","year":"1999","unstructured":"Mak, W. K., Morton, D. P., & Wood, R. K. (1999). Monte Carlo bounding techniques for determining solution quality in stochastic programs. Operations Research Letters, 24, 47\u201356.","journal-title":"Operations Research Letters"},{"key":"798_CR17","volume-title":"ICML\u20192005","author":"H. B. McMahan","year":"2005","unstructured":"McMahan, H. B., Likhachev, M., & Gordon, G. J. (2005). Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In: ICML\u20192005. New York: ACM."},{"key":"798_CR18","volume-title":"IJCAI 07","author":"L. Mercier","year":"2007","unstructured":"Mercier, L., & Van Hentenryck, P. (2007). Performance analysis of online anticipatory algorithms for large multistage stochastic integer programs. In: IJCAI 07 (Vol.\u00a02)."},{"key":"798_CR19","volume-title":"AAAI\u201907","author":"D. Parkes","year":"2007","unstructured":"Parkes, D., & Duong, A. (2007). An ironing-based approach to adaptive online mechanism design in single-valued domains. In: AAAI\u201907."},{"key":"798_CR20","series-title":"Handbooks in operations research and management series","volume-title":"Stochastic programming","year":"2003","unstructured":"Ruszczynski, A., Shapiro, A. (Eds.) (2003). Handbooks in operations research and management series: Vol.\u00a010. Stochastic programming. Amsterdam: Elsevier."},{"issue":"1","key":"798_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2005.02.003","volume":"34","author":"A. Shapiro","year":"2006","unstructured":"Shapiro, A. (2006). On complexity of multistage stochastic programs. Operations Research Letters, 34(1), 1\u20138.","journal-title":"Operations Research Letters"},{"key":"798_CR22","volume-title":"MISTA\u201907","author":"M. Thomas","year":"2007","unstructured":"Thomas, M., & Szczerbicka, H. (2007). Evaluating online scheduling techniques in uncertain environments. In: MISTA\u201907."},{"key":"798_CR23","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. (2006). Online stochastic combinatorial optimization. Cambridge: MIT Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0798-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0798-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0798-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T14:13:52Z","timestamp":1740665632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0798-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["798"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0798-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2010,11,2]]}}}