{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:25Z","timestamp":1740123205467,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10479-018-2908-x","type":"journal-article","created":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T07:53:55Z","timestamp":1527839635000},"page":"887-913","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A perfect information lower bound for robust lot-sizing problems"],"prefix":"10.1007","volume":"271","author":[{"given":"Marcio Costa","family":"Santos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9145-2525","authenticated-orcid":false,"given":"Michael","family":"Poss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dritan","family":"Nace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,1]]},"reference":[{"issue":"3","key":"2908_CR1","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.cor.2012.10.002","volume":"40","author":"A Agra","year":"2013","unstructured":"Agra, A., Christiansen, M., Figueiredo, R. M. V., Hvattum, L. M., Poss, M., & Requejo, C. (2013). The robust vehicle routing problem with time windows. Computers & OR, 40(3), 856\u2013866. \n                    https:\/\/doi.org\/10.1016\/j.cor.2012.10.002\n                    \n                  .","journal-title":"Computers & OR"},{"issue":"3","key":"2908_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. (2016). A dynamic programming approach for a class of robust optimization problems. SIAM Journal on Optimization, 26(3), 1799\u20131823.","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"2908_CR3","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1287\/opre.18.5.947","volume":"18","author":"M Avriel","year":"1970","unstructured":"Avriel, M., & Williams, A. (1970). The value of information and stochastic programming. Operations Research, 18(5), 947\u2013954.","journal-title":"Operations Research"},{"issue":"2","key":"2908_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10287-016-0249-2","volume":"13","author":"J Ayoub","year":"2016","unstructured":"Ayoub, J., & Poss, M. (2016). Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Computational Management Science, 13(2), 219\u2013239.","journal-title":"Computational Management Science"},{"key":"2908_CR5","first-page":"62","volume-title":"Lecture Notes in Computer Science","author":"Frank Baumann","year":"2014","unstructured":"Baumann, F., Buchheim, C., & Ilyina, A. (2014). Lagrangean decomposition for mean-variance combinatorial optimization. In Combinatorial optimization\u2014third international symposium, ISCO 2014, Lisbon, Portugal, March 5\u20137, 2014. Revised Selected Papers (pp. 62\u201374)."},{"issue":"3","key":"2908_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/msom.1050.0081","volume":"7","author":"A Ben-Tal","year":"2005","unstructured":"Ben-Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P. (2005). Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing & Service Operations Management, 7(3), 248\u2013271.","journal-title":"Manufacturing & Service Operations Management"},{"issue":"2","key":"2908_CR7","doi-asserted-by":"publisher","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. Mathematical Programming, 99(2), 351\u2013376.","journal-title":"Mathematical Programming"},{"issue":"4","key":"2908_CR8","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23(4), 769\u2013805.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2908_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., & Nemirovski, A. (2000). Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming, 88(3), 411\u2013424. \n                    https:\/\/doi.org\/10.1007\/PL00011380\n                    \n                  .","journal-title":"Mathematical Programming"},{"key":"2908_CR10","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1287\/opre.2016.1515","volume":"64","author":"D Bertsimas","year":"2014","unstructured":"Bertsimas, D., & Dunning, I. (2014). Multistage robust mixed integer optimization with adaptive partitions. Operations Research, 64, 980\u2013998.","journal-title":"Operations Research"},{"issue":"3","key":"2908_CR11","doi-asserted-by":"publisher","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. Operations Research, 63(3), 610\u2013627. \n                    https:\/\/doi.org\/10.1287\/opre.2015.1365\n                    \n                  .","journal-title":"Operations Research"},{"issue":"1","key":"2908_CR12","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. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1), 49\u201371. \n                    https:\/\/doi.org\/10.1007\/s10107-003-0396-4\n                    \n                  .","journal-title":"Mathematical Programming"},{"issue":"1","key":"2908_CR13","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. (2004). The price of robustness. Operations Research, 52(1), 35\u201353.","journal-title":"Operations Research"},{"issue":"1","key":"2908_CR14","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. (2006). A robust optimization approach to inventory theory. Operations Research, 54(1), 150\u2013168.","journal-title":"Operations Research"},{"issue":"2","key":"2908_CR15","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. (2008). Computing robust basestock levels. Discrete Optimization, 5(2), 389\u2013414. (in Memory of George B. Dantzig).","journal-title":"Discrete Optimization"},{"key":"2908_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.dam.2014.01.017","volume":"170","author":"A Billionnet","year":"2014","unstructured":"Billionnet, A., Costa, M., & Poirion, P. (2014). 2-Stage robust MILP with continuous recourse variables. Discrete Applied Mathematics, 170, 21\u201332.","journal-title":"Discrete Applied Mathematics"},{"key":"2908_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge, J. R., & Louveaux, F. (2011). Introduction to stochastic programming. Berlin: Springer."},{"key":"2908_CR18","unstructured":"Bougeret, M., Pessoa, A., & Poss, M. (2016). Robust scheduling with budgeted uncertainty. Discrete Applied Mathematics Conditionally. \n                    https:\/\/hal.archives-ouvertes.fr\/hal-01345283\/document\n                    \n                  ."},{"issue":"6","key":"2908_CR19","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"X Chen","year":"2009","unstructured":"Chen, X., & Zhang, Y. (2009). Uncertain linear programs: Extended affinely adjustable robust counterparts. Operations Research, 57(6), 1469\u20131482.","journal-title":"Operations Research"},{"issue":"1","key":"2908_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10287-016-0253-6","volume":"14","author":"FJCT Ruiter de","year":"2017","unstructured":"de Ruiter, F. J. C. T., Ben-Tal, A., Brekelmans, R., & den Hertog, D. (2017). Robust optimization of uncertain multistage inventory systems with inexact data in decision rules. Computational Management Science, 14(1), 45\u201366. \n                    https:\/\/doi.org\/10.1007\/s10287-016-0253-6\n                    \n                  .","journal-title":"Computational Management Science"},{"key":"2908_CR21","volume-title":"Computers and intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). New York: W. H. Freeman."},{"issue":"4\u2013part\u20131","key":"2908_CR22","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1287\/opre.1090.0795","volume":"58","author":"J Goh","year":"2010","unstructured":"Goh, J., & Sim, M. (2010). Distributionally robust optimization and its tractable approximations. Operations Research, 58(4\u2013part\u20131), 902\u2013917.","journal-title":"Operations Research"},{"issue":"1","key":"2908_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ejor.2012.10.007","volume":"227","author":"BL Gorissen","year":"2013","unstructured":"Gorissen, B. L., & den Hertog, D. (2013). Robust counterparts of inequalities containing sums of maxima of linear functions. European Journal of Operational Research, 227(1), 30\u201343.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2908_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1287\/opre.25.1.128","volume":"25","author":"CC Huang","year":"1977","unstructured":"Huang, C. C., & Vertinsky, W. T. Z. I. (1977). Sharp bounds on the value of perfect information. Operations Research, 25(1), 128\u2013139.","journal-title":"Operations Research"},{"key":"2908_CR25","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"2013","unstructured":"Kouvelis, P., & Yu, G. (2013). Robust discrete optimization and its applications (Vol. 14). Berlin: Springer."},{"key":"2908_CR26","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-009-0331-4","volume":"130","author":"D Kuhn","year":"2011","unstructured":"Kuhn, D., Wiesemann, W., & Georghiou, A. (2011). Primal and dual linear decision rules in stochastic and robust optimization. Mathematical Programming, 130, 177\u2013209.","journal-title":"Mathematical Programming"},{"issue":"7","key":"2908_CR27","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1111\/j.1524-4733.2008.00389.x","volume":"11","author":"JB Oostenbrink","year":"2008","unstructured":"Oostenbrink, J. B., Al, M. J., Oppe, M., & Rutten-van M\u00f6lken, M. P. (2008). Expected value of perfect information: An empirical example of reducing decision uncertainty by conducting additional research. Value in Health, 11(7), 1070\u20131080.","journal-title":"Value in Health"},{"key":"2908_CR28","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y Pochet","year":"1994","unstructured":"Pochet, Y., & Wolsey, L. A. (1994). Polyhedra for lot-sizing with wagner-whitin costs. Mathematical Programming, 67, 297\u2013323. \n                    https:\/\/doi.org\/10.1007\/BF01582225\n                    \n                  .","journal-title":"Mathematical Programming"},{"key":"2908_CR29","volume-title":"Production planning by mixed integer programming","author":"Y Pochet","year":"2013","unstructured":"Pochet, Y., & Wolsey, L. (2013). Production planning by mixed integer programming. Berlin: Springer."},{"issue":"1","key":"2908_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10288-012-0217-9","volume":"11","author":"M Poss","year":"2013","unstructured":"Poss, M. (2013). Robust combinatorial optimization with variable budgeted uncertainty. 4OR, 11(1), 75\u201392. \n                    https:\/\/doi.org\/10.1007\/s10288-012-0217-9\n                    \n                  .","journal-title":"4OR"},{"issue":"3","key":"2908_CR31","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1287\/ijoc.2016.0696","volume":"28","author":"K Postek","year":"2016","unstructured":"Postek, K., & den Hertog, D. (2016). Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS Journal on Computing, 28(3), 553\u2013574. \n                    https:\/\/doi.org\/10.1287\/ijoc.2016.0696\n                    \n                  .","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"2908_CR32","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. (2013). Solving two-stage robust optimization problems by a constraint-and-column generation method. Operations Research Letters, 41(5), 457\u2013461.","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2908-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2908-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2908-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T02:15:33Z","timestamp":1559355333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2908-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,1]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2908"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2908-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,6,1]]},"assertion":[{"value":"1 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}