{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:27:56Z","timestamp":1742923676944,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","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":[[2001]]},"DOI":"10.1007\/3-540-45578-7_5","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"61-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Benoist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Bourreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Caseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Rottembourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"5_CR1","unstructured":"F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko: Approximation schemes for minimizing average weighted completion time with release dates. Proc. of the 1999 Symposium on Foundations of Computer Science (FOCS99), 1999."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/opre.44.2.327","volume":"44","author":"A. N. Avramidis","year":"1996","unstructured":"A. N. Avramidis, J. R. Wilson: Integrated variance reduction strategies for simulation. Operations Research 44 (2): 327\u2013346, 1996.","journal-title":"Operations Research"},{"key":"5_CR3","unstructured":"R. Bellman. Dynamic Programming. Princeton University Press, 1957."},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/9.24227","volume":"34","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, D. A. Castanon. Adaptative aggregation for infinite horizon dynamic programming. IEEE Transactions on Automatic Control, 34(6):589\u2013598, 1989.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5_CR5","unstructured":"C. Boutilier, R. Dearden, M. Goldszmidt: Exploiting structure in policy construction. In Proceedings of the 1995 international joint conference on artificial intelligence, 1995."},{"key":"5_CR6","unstructured":"J. Birge, F. Louveaux,: Introduction to Stochastic Programming Springer Series in Operations Research, 1997."},{"key":"5_CR7","unstructured":"D. P. Bertsekas, J. N. Tsitsiklis: Neuro-dynamic Programming. Athena, Belmont, MA, 1996."},{"key":"5_CR8","series-title":"Lect Notes Comput Sci","volume-title":"A Meta-Heuristic Factory for Vehicle Routing Problems","author":"Y. Caseau","year":"2004","unstructured":"Y. Caseau, G. Silverstein. F. Laburthe, A Meta-Heuristic Factory for Vehicle Routing Problems, Proc. of the 5th Int. Conference on Principles and Practice of Constraint Programming CP\u201999, LNCS 1713, Springer, 1999."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.10.1.98","volume":"10","author":"F. D'Epenoux","year":"1963","unstructured":"F. D'Epenoux. A probabilistic production and inventory problem. Management Science: 10:98\u2013108, 1963.","journal-title":"Management Science"},{"key":"5_CR10","unstructured":"T. Dean, S. H. Lin. Decomposition techniques for planning in stochastic domains, In Proceedings of the 1995 international joint conference on artificial intelligence, 1995."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"A. Di Pierro, H. Wiklicky: Randomised Algorithms and Probabilistic Constraint Programming Proc. of the ERCIM\/Compulog Workshop on Constraints, 19\u201321 June, Padova, Italy, 2000.","DOI":"10.1145\/351268.351284"},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029561","volume-title":"Online Algorithms","author":"A. Fiat","year":"1998","unstructured":"A. Fiat, G. J. Woeginger: Online Algorithms Lecture Notes in Computer Science, vol. 1442."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"J. I. McGuill, G. J. Van Ryzin Revenue Management: research overview and prospects Transportation science vol.33 n\u00b02, may 1999.","DOI":"10.1287\/trsc.33.2.233"},{"key":"5_CR14","volume-title":"Dynamic programming and markov Chains","author":"R. A. Howard","year":"1960","unstructured":"R. A. Howard: Dynamic programming and markov Chains. MIT Press. Cambridge, 1960."},{"key":"5_CR15","unstructured":"W. Harvey, M. Ginsberg: Limited Discrepancy Search. Proceedings of the 14th IJCAI, p. 607\u2013615, Morgan Kaufmann, 1995."},{"key":"5_CR16","unstructured":"L. Hall, A. S. Schulz, D. Shmoys, J. Wein: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Proc of SODA: ACM-SIAM Symposium on Discrete Algorithms, 1996."},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/TAC.1974.1100636","volume":"AC-19","author":"H. J. Kushner","year":"1974","unstructured":"H. J. Kushner, C. H. Chen: Decomposition of systems governed by Markov chains. IEEE transactions on Automatic Control, AC-19(5):501\u2013507, 1974.","journal-title":"IEEE transactions on Automatic Control"},{"key":"5_CR18","unstructured":"N. Meuleau, M. Hauskrecht, K.-E. Kim, L. Peshkin, L. P. Kaelbling, T. dean, C. Boutilier. Solving Very Large Weakly Coupled Markov Decision Processes. American Association for Artificial Intelligence, 1998."},{"key":"5_CR19","volume-title":"Algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello, P. Toth, Knapsack problems. Algorithms and computer implementations. John Wiley and Sons, West Sussex, England, 1990."},{"key":"5_CR20","volume-title":"Uncertainty in Artificial Intelligence","author":"R. Parr","year":"1998","unstructured":"R. Parr. Flexible Decompostion Algorithms for weakly coupled Markov Decision Problems. Uncertainty in Artificial Intelligence. Madison, Wisconsin, USA, 1998"},{"key":"5_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Discrete Stochastic Dynamic Programming","author":"M. L. Puterman","year":"1994","unstructured":"M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, 1994."},{"key":"5_CR22","unstructured":"J. Papastavrou, S. Rajagopalan, A. Kleywegt: The Dynamic and Stochastic Knapsack Problem with Deadlines. Technical report, School of Industrial Engineering, Purdue University, West Lafayette, April 1995."},{"key":"5_CR23","volume-title":"NIPS-11","author":"S. P. Singh","year":"1998","unstructured":"S. P. Singh, D. Cohn. How to dynamically merge Markov Decision Processes. In M. Mozer, M. Jordan and T. Petsche eds, NIPS-11. MIT Press, Cambridge, 1998."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.40.5.831","volume":"40","author":"L. R. Weatherford","year":"1992","unstructured":"L. R. Weatherford, S. E. Bodily: A Taxonomy and Research Overview of Perishable-Asset Revenue Managment: Yield Managment, Overbooking and Pricing. Operations Research 40:831\u2013844, 1992","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T01:35:20Z","timestamp":1683855320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}