乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T14:34:03Z","timestamp":1720017243995},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,23]],"date-time":"2015-08-23T00:00:00Z","timestamp":1440288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100015388","name":"NSF EPSCoR","doi-asserted-by":"crossref","award":["EPS-0903806"],"id":[{"id":"10.13039\/100015388","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10898-015-0349-5","type":"journal-article","created":{"date-parts":[[2015,8,22]],"date-time":"2015-08-22T08:52:32Z","timestamp":1440233552000},"page":"231-259","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic programming approximation algorithms for the capacitated lot-sizing problem"],"prefix":"10.1007","volume":"65","author":[{"given":"\u0130. Esra","family":"B\u00fcy\u00fcktahtak\u0131n","sequence":"first","affiliation":[]},{"given":"Ning","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,23]]},"reference":[{"issue":"2","key":"349_CR1","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/moor.2013.0607","volume":"39","author":"D Adelman","year":"2013","unstructured":"Adelman, D., Barz, C.: A unifying approximate dynamic programming model for the economic lot scheduling problem. Math. Oper. Res. 39(2), 374\u2013402 (2013)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"349_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A., Mu\u00f1oz, J.C.: A study of the lot-sizing polytope. Math. Program. 99(3), 443\u2013465 (2004)","journal-title":"Math. Program."},{"key":"349_CR3","first-page":"155","volume":"17","author":"R Bellman","year":"1963","unstructured":"Bellman, R., Kalaba, R., Kotkin, B.: Polynomial approximation: a new computational technique in dynamic programming: allocation processes. Math. Comput. 17, 155\u2013161 (1963)","journal-title":"Math. Comput."},{"key":"349_CR4","volume-title":"Dynamic Programming and Optimal Control, 3rd edition","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edition, vol. ii. Athena Scientific, Belmont (2011)"},{"key":"349_CR5","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-dynamic programming: an overview. In: Proceedings of the 34th IEEE Conference on, Decision and Control, 1995., volume\u00a01, pp. 560\u2013564, (1995)","DOI":"10.1109\/CDC.1995.478953"},{"issue":"2","key":"349_CR6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.34.2.226","volume":"34","author":"GR Bitran","year":"1986","unstructured":"Bitran, G.R., Haas, E.A., Hirofumi, M.: Production planning of style goods with high setup costs and forecast revisions. Oper. Res. 34(2), 226\u2013236 (1986)","journal-title":"Oper. Res."},{"key":"349_CR7","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"\u0130E B\u00fcy\u00fcktahtak\u0131n","year":"2011","unstructured":"B\u00fcy\u00fcktahtak\u0131n, \u0130.E.: Dynamic programming via linear programming. In: Cochran Jr, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, Hoboken, NJ (2011)"},{"key":"349_CR8","unstructured":"B\u00fcy\u00fcktahtak\u0131n, \u0130.E.: Mixed Integer Programming Approaches to Lot-Sizing and Asset Replacement Problems. PhD thesis, Industrial and Systems Engineering, University of Florida, (2009)"},{"issue":"3","key":"349_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01098363","volume":"4","author":"HD Chen","year":"1994","unstructured":"Chen, H.D., Hearn, D.W., Lee, C.Y.: A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Global Optim. 4(3), 285\u2013300 (1994)","journal-title":"J. Global Optim."},{"issue":"4","key":"349_CR10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01099265","volume":"4","author":"H-D Chen","year":"1994","unstructured":"Chen, H.-D., Hearn, D.W., Lee, C.-Y.: A dynamic programming algorithm for dynamic lot size models with piecewise linear costs. J. Global Optim. 4(4), 397\u2013413 (1994)","journal-title":"J. Global Optim."},{"issue":"8","key":"349_CR11","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.37.8.909","volume":"37","author":"A Federgruen","year":"1991","unstructured":"Federgruen, A., Tzur, M.: A simple forward algorithm to solve general dynamic lot sizing models with $$n$$ n periods in $${O}(n \\log n)$$ O ( n log n ) or $${O}(n)$$ O ( n ) time. Manage. Sci. 37(8), 909\u2013925 (1991)","journal-title":"Manage. Sci."},{"issue":"7","key":"349_CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","volume":"26","author":"M Florian","year":"1980","unstructured":"Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G.: Deterministic production planning: algorithms and complexity. Manag. Sci. 26(7), 669\u2013679 (1980)","journal-title":"Manag. Sci."},{"issue":"12","key":"349_CR13","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1080\/0740817X.2010.504683","volume":"42","author":"JC Hartman","year":"2010","unstructured":"Hartman, J.C., B\u00fcy\u00fcktahtak\u0131n, \u0130.E., Smith, J.C.: Dynamic-programming-based inequalities for the capacitated lot-sizing problem. IIE Trans. 42(12), 915\u2013930 (2010)","journal-title":"IIE Trans."},{"issue":"1","key":"349_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1111\/j.2517-6161.1969.tb00772.x","volume":"31","author":"DJ Hudson","year":"1969","unstructured":"Hudson, D.J.: Least-squares fitting of a polynomial constrained to be either non-negative non-decreasing or convex. J. R. Stat. Soc. Ser. B (Methodol.) 31(1), 113\u2013118 (1969)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"issue":"3","key":"349_CR15","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1111\/j.1937-5956.2012.01420.x","volume":"22","author":"D Klabjan","year":"2013","unstructured":"Klabjan, D., Simchi-Levi, D., Song, M.: Robust stochastic lot-sizing by means of histograms. Prod. Oper. Manag. 22(3), 691\u2013710 (2013)","journal-title":"Prod. Oper. Manag."},{"key":"349_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/trsc.1030.0041","volume":"38","author":"AJ Kleywegt","year":"2004","unstructured":"Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P.: Dynamic programming approximations for a stochastic inventory routing problem. Transp. Sci. 38, 42\u201370 (2004)","journal-title":"Transp. Sci."},{"key":"349_CR17","first-page":"90","volume-title":"INFORMS TutORials in Operations Research","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2011","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: Mixed-integer optimization approaches for deterministic and stochastic inventory management. In: Geunes, J.P. (ed.) INFORMS TutORials in Operations Research, vol. 8, pp. 90\u2013105. INFORMS, Hanover, MD (2011)"},{"issue":"2","key":"349_CR18","first-page":"416","volume":"33","author":"R Levi","year":"2008","unstructured":"Levi, R., Lodi, A., Sviridenko, M.: Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33(2), 416\u2013474 (2008)","journal-title":"Math. Oper. Res."},{"key":"349_CR19","first-page":"3055","volume":"22","author":"VM Muggeo","year":"2003","unstructured":"Muggeo, V.M.: Estimating regression models with unknown break-points. Stat. Med. Wiley Online Libr. 22, 3055\u20133071 (2003)","journal-title":"Stat. Med. Wiley Online Libr."},{"key":"349_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"1","key":"349_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","volume":"37","author":"Y Pochet","year":"1991","unstructured":"Pochet, Y., Wolsey, L.A.: Solving multi-item lot-sizing problems using strong cutting planes. Manage. Sci. 37(1), 53\u201367 (1991)","journal-title":"Manage. Sci."},{"key":"349_CR22","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, Berlin (2006)"},{"key":"349_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"An Approximate Dynamic Programming Approach to Multi-dimensional Knapsack Problems","author":"WB Powell","year":"2007","unstructured":"Powell, W.B.: An Approximate Dynamic Programming Approach to Multi-dimensional Knapsack Problems. Wiley, New York (2007)"},{"key":"349_CR24","doi-asserted-by":"crossref","unstructured":"Powell, W.B.: Perspectives of approximate dynamic programming. Ann. Oper. Res. 1\u201338 (2012)","DOI":"10.1007\/s10479-012-1077-6"},{"key":"349_CR25","volume-title":"Reinforcement Learning","author":"R Sutton","year":"1998","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning. MIT Press, Cambridge (1998)"},{"issue":"8","key":"349_CR26","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1002\/nav.20433","volume":"57","author":"A Toriello","year":"2010","unstructured":"Toriello, A., Nemhauser, G., Savelsbergh, M.: Decomposing inventory routing problems with approximate value functions. Naval Res. Logist. 57(8), 718\u2013727 (2010)","journal-title":"Naval Res. Logist."},{"key":"349_CR27","first-page":"59","volume":"22","author":"JN Tsitsiklis","year":"1996","unstructured":"Tsitsiklis, J.N., Van Roy, B.: Feature-based methods for largescale dynamic programming. Mach. Learn. 22, 59\u201394 (1996)","journal-title":"Mach. Learn."},{"issue":"2","key":"349_CR28","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.26.2.339.10552","volume":"26","author":"CPM Hoesel Van","year":"2001","unstructured":"Van Hoesel, C.P.M., Wagelmans, A.P.M.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26(2), 339\u2013357 (2001)","journal-title":"Math. Oper. Res."},{"key":"349_CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manage. Sci. 5, 89\u201396 (1958)","journal-title":"Manage. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0349-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0349-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0349-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T17:54:02Z","timestamp":1718042042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0349-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,23]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["349"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0349-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,23]]}}}