{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:56Z","timestamp":1740145196196,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE10-0012"],"award-info":[{"award-number":["ANR-18-CE10-0012"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"crossref","award":["2017\/25\/B\/ST6\/00486"],"award-info":[{"award-number":["2017\/25\/B\/ST6\/00486"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2017\/25\/B\/ST6\/00486"],"award-info":[{"award-number":["2017\/25\/B\/ST6\/00486"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11590-022-01875-9","type":"journal-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:48:09Z","timestamp":1648846089000},"page":"2543-2556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust inventory problem with budgeted cumulative demand uncertainty"],"prefix":"10.1007","volume":"16","author":[{"given":"Romain","family":"Guillaume","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1956-1812","authenticated-orcid":false,"given":"Adam","family":"Kasperski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1466-2887","authenticated-orcid":false,"given":"Pawe\u0142","family":"Zieli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,1]]},"reference":[{"key":"1875_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ijpe.2018.04.002","volume":"200","author":"A Agra","year":"2018","unstructured":"Agra, A., Poss, M., Santos, M.: Optimizing make-to-stock policies through a robust lot-sizing model. Int. J. Prod. Econ. 200, 302\u2013310 (2018)","journal-title":"Int. J. Prod. Econ."},{"key":"1875_CR2","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/15M1007070","volume":"26","author":"A Agra","year":"2016","unstructured":"Agra, A., Santos, M.C., Nace, D., Poss, M.: A dynamic programming approach for a class of robust optimization problems. SIAM J. Optim. 26, 1799\u20131823 (2016)","journal-title":"SIAM J. Optim."},{"key":"1875_CR3","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"1875_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cor.2011.02.022","volume":"39","author":"DJ Alem","year":"2012","unstructured":"Alem, D.J., Morabito, R.: Production planning in furniture settings via robust optimization. Comput. Oper. Res. 39, 139\u2013150 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1875_CR5","doi-asserted-by":"crossref","unstructured":"Attila, \u00d6.\u00a0N., Agra, A., Akartunali, K., Arulselvan, A.: A decomposition algorithm for robust lot sizing problem with remanufacturing option. In O.\u00a0Gervasi and et.al, editors, Computational Science and Its Applications - ICCSA 2017, Part II, volume 10405 of Lecture Notes in Computer Science, pp. 684\u2013695. Springer (2017)","DOI":"10.1007\/978-3-319-62395-5_47"},{"key":"1875_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49\u201371 (2003)","journal-title":"Math. Program."},{"key":"1875_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"1875_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.1050.0238","volume":"54","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., Thiele, A.: A robust optimization approach to inventory theory. Oper. Res. 54, 150\u2013168 (2006)","journal-title":"Oper. Res."},{"key":"1875_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.disopt.2006.12.002","volume":"5","author":"D Bienstock","year":"2008","unstructured":"Bienstock, D., \u00d6zbay, N.: Computing robust basestock levels. Discret. Optim. 5, 389\u2013414 (2008)","journal-title":"Discret. Optim."},{"key":"1875_CR10","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.ejor.2017.05.008","volume":"263","author":"N Brahimi","year":"2017","unstructured":"Brahimi, N., Absi, N., Dauz\u00e8re-P\u00e9r\u00e8s, S., Nordli, A.: Single-item dynamic lot-sizing problems: an updated survey. Eur. J. Oper. Res. 263, 838\u2013863 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1875_CR11","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"1875_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1993)"},{"key":"1875_CR13","doi-asserted-by":"crossref","unstructured":"Guillaume, R., Kasperski, A., Zieli\u0144ski, P.: Production planning under demand uncertainty: a budgeted uncertainty approach. In: Neufeld, J.S., Buscher, U., asch, R., M\u00f6st, D., Sch\u00f6nberger, J., (eds) Operations Research Proceedings 2019. Springer, Berlin, 431\u2013437 (2020)","DOI":"10.1007\/978-3-030-48439-2_52"},{"key":"1875_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.fss.2012.01.015","volume":"206","author":"R Guillaume","year":"2012","unstructured":"Guillaume, R., Kobyla\u0144ski, P., Zieli\u0144ski, P.: A robust lot sizing problem with ill-known demands. Fuzzy Sets Syst. 206, 39\u201357 (2012)","journal-title":"Fuzzy Sets Syst."},{"key":"1875_CR15","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1080\/09537281003800900","volume":"22","author":"R Guillaume","year":"2011","unstructured":"Guillaume, R., Thierry, C., Grabot, B.: Modelling of ill-known requirements and integration in production planning. Prod. Plann. Control 22, 336\u2013352 (2011)","journal-title":"Prod. Plann. Control"},{"key":"1875_CR16","doi-asserted-by":"publisher","first-page":"6824","DOI":"10.1080\/00207543.2017.1353157","volume":"55","author":"R Guillaume","year":"2017","unstructured":"Guillaume, R., Thierry, C., Zieli\u0144ski, P.: Robust material requirement planning with cumulative demand under uncertainty. Int. J. Prod. Res. 55, 6824\u20136845 (2017)","journal-title":"Int. J. Prod. Res."},{"key":"1875_CR17","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/130925153","volume":"28","author":"N Halman","year":"2014","unstructured":"Halman, N., Klabjan, D., Li, C., Orlin, J.B., Simchi-Levi, D.: Fully polynomial time approximation schemes for stochastic dynamic programs. SIAM J. Discret. Math. 28, 1725\u20131796 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"1875_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00170-018-3151-y","volume":"102","author":"A Jamalnia","year":"2019","unstructured":"Jamalnia, A., Yang, J.-B., Feili, A., Xu, D.-L., Jamali, G.: Aggregate production planning under uncertainty: a comprehensive literature survey and future research directions. Int. J. Adv. Manuf. Technol. 102, 159\u2013181 (2019)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1875_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics. Springer, Berlin (2012)"},{"key":"1875_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Philadelphia (1997)"},{"key":"1875_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.orl.2014.06.007","volume":"42","author":"R Levi","year":"2014","unstructured":"Levi, R., Perakis, G., Romero, G.: A continuous knapsack problem with separable convex utilities: approximation algorithms and applications. Oper. Res. Lett. 42, 367\u2013373 (2014)","journal-title":"Oper. Res. Lett."},{"key":"1875_CR22","volume-title":"Nonlinear Programming Theory and Methods","author":"B Martos","year":"1975","unstructured":"Martos, B.: Nonlinear Programming Theory and Methods. Akad\u00e9miai Kiad\u00f3, Budapest (1975)"},{"key":"1875_CR23","unstructured":"Nasrabadi, E., Orlin, J.B.: Robust Optimization with Incremental Recourse. CoRR, abs\/1312.4075, (2013)"},{"key":"1875_CR24","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":"1875_CR25","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10479-019-03264-5","volume":"289","author":"MC Santos","year":"2020","unstructured":"Santos, M.C., Agra, A., Poss, M.: Robust inventory theory with perishable products. Ann. Oper. Res. 289, 473\u2013494 (2020)","journal-title":"Ann. Oper. Res."},{"key":"1875_CR26","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ijpe.2009.11.008","volume":"134","author":"C Wei","year":"2011","unstructured":"Wei, C., Li, Y., Cai, X.: Robust optimal policies of production and inventory with uncertain returns and demand. Int. J. Prod. Econ. 134, 357\u2013367 (2011)","journal-title":"Int. J. Prod. Econ."},{"key":"1875_CR27","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column and constraint generation method. Oper. Res. Lett. 41, 457\u2013461 (2013)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01875-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01875-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01875-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:04:45Z","timestamp":1666875885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01875-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1875"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01875-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,4,1]]},"assertion":[{"value":"3 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}