{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:06Z","timestamp":1725514206767},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_31","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"450-462","source":"Crossref","is-referenced-by-count":3,"title":["A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging"],"prefix":"10.1007","author":[{"given":"Yongpei","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.41.3.549","volume":"41","author":"A. Aggarwal","year":"1993","unstructured":"Aggarwal, A., Park, J.K.: Improved algorithms for economic lot size problems. Operations Research\u00a041, 549\u2013571 (1993)","journal-title":"Operations Research"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1023062915106","volume":"26","author":"S. Ahmed","year":"2003","unstructured":"Ahmed, S., King, A.J., Parija, G.: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. Journal of Global Optimization\u00a026, 3\u201324 (2003)","journal-title":"Journal of Global Optimization"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.51.3.461.14960","volume":"51","author":"S. Ahmed","year":"2003","unstructured":"Ahmed, S., Sahinidis, N.V.: An approximation scheme for stochastic integer programs arising in capacity expansion. Operations Research\u00a051, 461\u2013471 (2003)","journal-title":"Operations Research"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","volume":"46","author":"G. Belvaux","year":"2000","unstructured":"Belvaux, G., Wolsey, L.A.: bc\u2009\u2212\u2009prod: a specialized branch\u2013and\u2013cut system for lot-sizing problems. Management Science\u00a046, 724\u2013738 (2000)","journal-title":"Management Science"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1287\/mnsc.47.7.993.9800","volume":"47","author":"G. Belvaux","year":"2001","unstructured":"Belvaux, G., Wolsey, L.A.: Modelling practical lot\u2013sizing problems as mixed integer programs. Management Science\u00a047, 993\u20131007 (2001)","journal-title":"Management Science"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1080\/1055678021000033937","volume":"17","author":"P. Beraldi","year":"2002","unstructured":"Beraldi, P., Ruszczy\u0144ski, A.: A branch and bound method for stochastic integer problems under probabilistic constraints. Optimization Methods and Software\u00a017, 359\u2013382 (2002)","journal-title":"Optimization Methods and Software"},{"key":"31_CR7","unstructured":"Car\u00f8e, C.C.: Decomposition in stochastic integer programming. PhD thesis, University of Copenhagen (1998)"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/mnsc.6.4.475","volume":"6","author":"A.J. Clark","year":"1960","unstructured":"Clark, A.J., Scarf, H.: Optimal policies for a multi-echelon inventory problem. Management Science\u00a06, 475\u2013490 (1960)","journal-title":"Management Science"},{"key":"31_CR9","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 periods in $\\mathcal{O}$ (n logn) or $\\mathcal{O}$ (n) time. Management Science\u00a037, 909\u2013925 (1991)","journal-title":"Management Science"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/1520-6750(199306)40:4<459::AID-NAV3220400404>3.0.CO;2-8","volume":"40","author":"A. Federgruen","year":"1993","unstructured":"Federgruen, A., Tzur, M.: The dynamic lot-sizing model with backlogging-a simple $\\mathcal{O}$ (n logn) algorithm and minimal forecast horizon procedure. Naval Research Logistics\u00a040, 459\u2013478 (1993)","journal-title":"Naval Research Logistics"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/mnsc.18.1.12","volume":"18","author":"M. Florian","year":"1971","unstructured":"Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Management Science\u00a018, 12\u201320 (1971)","journal-title":"Management Science"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0572-9","volume":"105","author":"Y. Guan","year":"2006","unstructured":"Guan, Y., Ahmed, S., Nemhauser, G.L., Miller, A.J.: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Mathematical Programming\u00a0105, 55\u201384 (2006)","journal-title":"Mathematical Programming"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Guan, Y., Miller, A.J.: Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. Operations Research (to appear, 2007)","DOI":"10.1287\/opre.1070.0479"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1287\/mnsc.47.10.1384","volume":"47","author":"C.Y. Lee","year":"2001","unstructured":"Lee, C.Y., Cetinkaya, S., Wagelmans, A.: A dynamic lot-sizing model with demand time windows. Management Science\u00a047, 1384\u20131395 (2001)","journal-title":"Management Science"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1287\/mnsc.1030.0164","volume":"50","author":"G. Lulli","year":"2004","unstructured":"Lulli, G., Sen, S.: A branch-and-price algorithm for multi-stage stochastic integer programming with application to stochastic batch-sizing problems. Management Science\u00a050, 786\u2013796 (2004)","journal-title":"Management Science"},{"key":"31_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"31_CR17","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, New York (2006)"},{"volume-title":"Stochastic Programming. Handbooks in Operations Research and Management Science","year":"2003","key":"31_CR18","unstructured":"Ruszczy\u0144ski, A., Shapiro, A. (eds.): Stochastic Programming. Handbooks in Operations Research and Management Science, vol.\u00a010. Elsevier Science B.V., Amsterdam (2003)"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"106","author":"S. Sen","year":"2006","unstructured":"Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Mathematical Programming\u00a0106, 203\u2013223 (2006)","journal-title":"Mathematical Programming"},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.51.3.487.14949","volume":"51","author":"H. Stadtler","year":"2003","unstructured":"Stadtler, H.: Multi-level lot-sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research\u00a051, 487\u2013502 (2003)","journal-title":"Operations Research"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Di Summa, M., Wolsey, L.A.: Lot-sizing on a tree. Technical report, CORE, UCL, Louvain-la-Neuve, Belgium (2006)","DOI":"10.2139\/ssrn.922292"},{"key":"31_CR22","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H. Tempelmeier","year":"1996","unstructured":"Tempelmeier, H., Derstroff, M.: A Lagrangean\u2013based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science\u00a042, 738\u2013757 (1996)","journal-title":"Management Science"},{"key":"31_CR23","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/mnsc.42.1.142","volume":"42","author":"C.P.M. Hoesel van","year":"1996","unstructured":"van Hoesel, C.P.M., Wagelmans, A.: An $\\mathcal{O}$ (T 3) algorithm for the economic lot-sizing problem with constant capacities. Management Science\u00a042, 142\u2013150 (1996)","journal-title":"Management Science"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A. Wagelmans","year":"1992","unstructured":"Wagelmans, A., van Hoesel, A., Kolen, A.: Economic lot sizing: An $\\mathcal{O}$ (n logn) algorithm that runs in linear time in the Wagner\u2013Whitin case. Operations Research\u00a040, 145\u2013156 (1992)","journal-title":"Operations Research"},{"key":"31_CR25","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68891-4_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:25:53Z","timestamp":1708964753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_31","relation":{},"subject":[]}}