{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:57Z","timestamp":1759847877999,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T00:00:00Z","timestamp":1499126400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006360","name":"Bundesministerium f\u00fcr Wirtschaft und Energie","doi-asserted-by":"publisher","award":["03ET7528B."],"award-info":[{"award-number":["03ET7528B."]}],"id":[{"id":"10.13039\/501100006360","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10878-017-0147-8","type":"journal-article","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:26:36Z","timestamp":1499135196000},"page":"763-788","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Lot sizing with storage losses under demand uncertainty"],"prefix":"10.1007","volume":"36","author":[{"given":"Stefano","family":"Coniglio","sequence":"first","affiliation":[]},{"given":"Arie M. C. A.","family":"Koster","sequence":"additional","affiliation":[]},{"given":"Nils","family":"Spiekermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,4]]},"reference":[{"issue":"3","key":"147_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.orl.2007.08.004","volume":"36","author":"A Atamt\u00fcrk","year":"2008","unstructured":"Atamt\u00fcrk A, K\u00fc\u00e7\u00fckyavuz S (2008) An algorithm for lot sizing with inventory bounds and fixed costs. Oper Res Lett 36(3):297\u2013299","journal-title":"Oper Res Lett"},{"issue":"2","key":"147_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351\u2013376","journal-title":"Math Program"},{"key":"147_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton"},{"issue":"3","key":"147_CR4","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1287\/opre.2015.1365","volume":"63","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas D, Georghiou A (2015) Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper Res 63(3):610\u2013627","journal-title":"Oper Res"},{"issue":"1\u20133","key":"147_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(1\u20133):49\u201371","journal-title":"Math Program"},{"issue":"1","key":"147_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"key":"147_CR7","first-page":"86","volume":"2004","author":"B Bertsimas","year":"2004","unstructured":"Bertsimas B, Thiele A (2004) A robust optimization approach to supply chain management. IPCO 2004:86\u2013100","journal-title":"IPCO"},{"issue":"1","key":"147_CR8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.1050.0238","volume":"54","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper Res 54(1):150\u2013168","journal-title":"Oper Res"},{"key":"147_CR9","unstructured":"Bishop CM (2006) Pattern recognition. Mach Learn 128"},{"issue":"9","key":"147_CR10","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1287\/mnsc.34.9.1096","volume":"34","author":"JH Bookbinder","year":"1988","unstructured":"Bookbinder JH, Tan J-Y (1988) Strategies for the probabilistic lot-sizing problem with service-level constraints. Manag Sci 34(9):1096\u20131108","journal-title":"Manag Sci"},{"issue":"3","key":"147_CR11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11590-011-0307-1","volume":"5","author":"C B\u00fcsing","year":"2011","unstructured":"B\u00fcsing C, Koster AMCA, Kutschka M (2011) Recoverable robust knapsacks: the discrete scenario case. Optim Lett 5(3):379\u2013392","journal-title":"Optim Lett"},{"issue":"10","key":"147_CR12","doi-asserted-by":"crossref","first-page":"2463","DOI":"10.1016\/j.automatica.2008.02.007","volume":"44","author":"GC Calafiore","year":"2008","unstructured":"Calafiore GC (2008) Multi-period portfolio optimization with linear control policies. Automatica 44(10):2463\u20132473","journal-title":"Automatica"},{"key":"147_CR13","unstructured":"Caramanis C (2006) Adaptable optimization: theory and algorithms. PhD thesis, Massachusetts Institute of Technology"},{"key":"147_CR14","doi-asserted-by":"crossref","unstructured":"Coniglio S, Koster AMCA, Spiekermann N (2016) On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration. Lecture notes in computer science. pp 1\u201312","DOI":"10.1007\/978-3-319-45587-7_3"},{"issue":"7","key":"147_CR15","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 JK, Rinnooy Kan AHG (1980) Deterministic production planning: algorithms and complexity. Manag Sci 26(7):669\u2013679","journal-title":"Manag Sci"},{"issue":"1","key":"147_CR16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.ejor.2012.04.024","volume":"222","author":"B Hellion","year":"2012","unstructured":"Hellion B, Mangione F, Penz B (2012) A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. Eur J Oper Res 222(1):10\u201316","journal-title":"Eur J Oper Res"},{"issue":"8","key":"147_CR17","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1287\/mnsc.46.8.1159.12021","volume":"46","author":"VN Hsu","year":"2000","unstructured":"Hsu VN (2000) Dynamic economic lot size model with perishable inventory. Manag Sci 46(8):1159\u20131169","journal-title":"Manag Sci"},{"issue":"4","key":"147_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.orl.2004.08.003","volume":"33","author":"LH Liyanage","year":"2005","unstructured":"Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Oper Res Lett 33(4):341\u2013348","journal-title":"Oper Res Lett"},{"key":"147_CR19","volume-title":"Production planning by mixed integer programming","author":"Y Pochet","year":"2006","unstructured":"Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, New York"},{"key":"147_CR20","unstructured":"Scarft H (1960) The optimality of $$(s, S)$$ ( s , S ) policies in the dynamic inventory problem. In: Arrow KJ, Karlin S, Suppes P (eds) Mathemtical methods in the social sciences, vol 1. Stanford University Press, p 196"},{"key":"147_CR21","doi-asserted-by":"crossref","unstructured":"Tempelmeier H (2013) Stochastic lot sizing problems. In: Handbook of stochastic models and analysis of manufacturing system operations. Springer, New York, pp 313\u2013344","DOI":"10.1007\/978-1-4614-6777-9_10"},{"issue":"3","key":"147_CR22","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.ejor.2011.02.012","volume":"212","author":"H Tempelmeier","year":"2011","unstructured":"Tempelmeier H, Herpers S (2011) Dynamic uncapacitated lot sizing with random demand under a fillrate constraint. Eur J Oper Res 212(3):497\u2013507","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0147-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0147-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0147-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T06:38:38Z","timestamp":1569652718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0147-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,4]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0147-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,7,4]]}}}