{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:34:51Z","timestamp":1725744891445},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_49","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"577-588","source":"Crossref","is-referenced-by-count":1,"title":["A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs"],"prefix":"10.1007","author":[{"given":"Nir","family":"Halman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacomo","family":"Nannicini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","volume-title":"Dynamic Programming and Optimal Control","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont (1995)"},{"key":"49_CR2","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"49_CR3","unstructured":"Halman, N., Klabjan, D., Li, C.L., Orlin, J., Simchi-Levi, D.: Fully polynomial time approximation schemes for stochastic dynamic programs. In: Teng, S.H. (ed.) SODA, pp. 700\u2013709. SIAM (2008)"},{"key":"49_CR4","unstructured":"Nascimento, J.M.: Approximate dynamic programming for complex storage problems. PhD thesis, Princeton University (2008)"},{"issue":"3","key":"49_CR5","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/moor.1090.0391","volume":"34","author":"N. Halman","year":"2009","unstructured":"Halman, N., Klabjan, D., Mostagir, M., Orlin, J., Simchi-Levi, D.: A fully polynomial time approximation scheme for single-item inventory control with discrete demand. Mathematics of Operations Research\u00a034(3), 674\u2013685 (2009)","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"49_CR6","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/mnsc.1100.1143","volume":"56","author":"J. Nascimento","year":"2010","unstructured":"Nascimento, J., Powell, W.: Dynamic programming models and algorithms for the mutual fund cash balance problem. Management Science\u00a056(5), 801\u2013815 (2010)","journal-title":"Management Science"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2008.07.047","volume":"198","author":"C. Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Implementing an efficient FPTAS for the 0-1 multiobjective knapsack problem. European Journal of Operations Research\u00a0198(1), 47\u201356 (2009)","journal-title":"European Journal of Operations Research"},{"key":"49_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K. Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia (2003)"},{"issue":"2","key":"49_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1287\/opre.1110.1031","volume":"60","author":"N. Halman","year":"2012","unstructured":"Halman, N., Orlin, J.B., Simchi-Levi, D.: Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle. Operations Research\u00a060(2), 429\u2013446 (2012)","journal-title":"Operations Research"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Halman, N., Klabjan, D., Li, C.L., Orlin, J., Simchi-Levi, D.: Fully polynomial time approximation schemes for stochastic dynamic programs. Technical Report 3918, Optimization Online (June 2013)","DOI":"10.1137\/130925153"},{"issue":"3","key":"49_CR11","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J. Kiefer","year":"1953","unstructured":"Kiefer, J.: Sequential minimax search for a maximum. Proceedings of the American Mathematical Society\u00a04(3), 502\u2013506 (1953)","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T22:43:27Z","timestamp":1563662607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}