{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T16:42:35Z","timestamp":1726418555747},"reference-count":61,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:00:00Z","timestamp":1674518400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1016\/j.cor.2023.106149","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:30:24Z","timestamp":1673915424000},"page":"106149","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems"],"prefix":"10.1016","volume":"153","author":[{"given":"\u0130. Esra","family":"B\u00fcy\u00fcktahtak\u0131n","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2023.106149_b1","series-title":"Probabilistic Methods Applied to Power Systems, PMAPS, 2014 International Conference on","first-page":"1","article-title":"Risk-averse medium-term hydro optimization considering provision of spinning reserves","author":"Abgottspon","year":"2014"},{"issue":"6","key":"10.1016\/j.cor.2023.106149_b2","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.orl.2013.07.009","article-title":"A scenario decomposition algorithm for 0\u20131 stochastic programs","volume":"41","author":"Ahmed","year":"2013","journal-title":"Oper. Res. Lett."},{"issue":"1\u20134","key":"10.1016\/j.cor.2023.106149_b3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/B:ANOR.0000004773.66339.df","article-title":"Dynamic capacity acquisition and assignment under uncertainty","volume":"124","author":"Ahmed","year":"2003","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b4","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1016\/j.ejor.2017.12.022","article-title":"Risk management for forestry planning under uncertainty in demand and prices","volume":"267","author":"Alonso-Ayuso","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0377-2217(02)00628-8","article-title":"BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0\u20131 programs","volume":"151","author":"Alonso-Ayuso","year":"2003","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10107-018-1298-9","article-title":"Scenario reduction for stochastic programs with conditional value-at-risk","volume":"170","author":"Arp\u00f3n","year":"2018","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","article-title":"A study of the lot-sizing polytope","volume":"99","author":"Atamt\u00fcrk","year":"2004","journal-title":"Math. Program."},{"issue":"10","key":"10.1016\/j.cor.2023.106149_b8","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","article-title":"Strong formulations for multi-item capacitated lot sizing","volume":"30","author":"Barany","year":"1984","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10287-004-0020-y","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"2","author":"Benders","year":"2005","journal-title":"Comput. Manag. Sci."},{"key":"10.1016\/j.cor.2023.106149_b10","doi-asserted-by":"crossref","DOI":"10.1287\/opre.2022.2265","article-title":"Optimization-based scenario reduction for data-driven two-stage stochastic optimization","author":"Bertsimas","year":"2022","journal-title":"Oper. Res."},{"year":"2011","series-title":"Introduction to Stochastic Programming","author":"Birge","key":"10.1016\/j.cor.2023.106149_b11"},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(90)90053-F","article-title":"Polyhedral results for the precedence-constrained knapsack problem","volume":"41","author":"Boyd","year":"1993","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b13","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1016\/j.ejor.2015.10.013","article-title":"Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty","volume":"250","author":"Bruno","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b14","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1016\/j.ejor.2021.08.035","article-title":"Risk-averse multi-stage stochastic optimization for surveillance and operations planning of a forest insect infestation","volume":"299","author":"Bushaj","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b15","doi-asserted-by":"crossref","DOI":"10.1111\/nrm.12267","article-title":"Optimizing surveillance and management of emerald ash borer in urban environments","volume":"34","author":"Bushaj","year":"2021","journal-title":"Nat. Resour. Model."},{"key":"10.1016\/j.cor.2023.106149_b16","first-page":"1","article-title":"A simulation-deep reinforcement learning (SiRL) approach for epidemic control optimization","author":"Bushaj","year":"2022","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2023.106149_b17","series-title":"Wiley Encyclopedia of Operations Research and Management Science","article-title":"Dynamic programming via linear programming","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2011"},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-021-04388-3","article-title":"Stage-t scenario dominance for risk-averse multi-stage stochastic mixed-integer programs","volume":"309","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2022","journal-title":"Ann. Oper. Res."},{"year":"2023","series-title":"SysOptiMaL SMIPLIB: Systems optimization and machine learning laboratory multi-stage stochastic multi-dimensional mixed 0-1 knapsack (S-MKP) and multi-stage stochastic multi-item capacitated lot-sizing (S-MCLSP) test problem library","author":"B\u00fcy\u00fcktahtak\u0131n","key":"10.1016\/j.cor.2023.106149_b19"},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b20","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1016\/j.ejor.2017.08.037","article-title":"A new epidemics-logistics model: Insights into controlling the ebola virus disease in West Africa","volume":"265","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10898-015-0349-5","article-title":"Dynamic programming approximation algorithms for the capacitated lot-sizing problem","volume":"65","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2016","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cor.2023.106149_b22","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.cor.2017.11.006","article-title":"Partial objective inequalities for the multi-item capacitated lot-sizing problem","volume":"91","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.cor.2023.106149_b23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","article-title":"Dual decomposition in stochastic integer programming","volume":"24","author":"Car\u00f8E","year":"1999","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b24","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/opre.1080.0593","article-title":"Stochastic power generation unit commitment in electricity markets: A novel formulation and a comparison of solution methods","volume":"57","author":"Cerisola","year":"2009","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b25","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.ejor.2011.11.040","article-title":"Stochastic dual dynamic programming applied to nonconvex hydrothermal models","volume":"218","author":"Cerisola","year":"2012","journal-title":"European J. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2023.106149_b26","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/S0305-0548(00)00076-9","article-title":"A scenario-based stochastic programming approach for technology and capacity planning","volume":"29","author":"Chen","year":"2002","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106149_b27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.cie.2017.02.017","article-title":"A two-stage stochastic mixed-integer programming approach to the competition of biofuel and food production","volume":"107","author":"Cobuloglu","year":"2017","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02282041","article-title":"Multi-stage stochastic linear programs for portfolio optimization","volume":"45","author":"Dantzig","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2023.106149_b29","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.cor.2015.09.005","article-title":"Cluster Lagrangean decomposition in multistage stochastic optimization","volume":"67","author":"Escudero","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10107-016-1000-z","article-title":"Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs","volume":"157","author":"Gade","year":"2016","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/opre.1080.0535","article-title":"Cutting planes for multistage stochastic integer programs","volume":"57","author":"Guan","year":"2009","journal-title":"Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2023.106149_b32","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1080\/0740817X.2010.504683","article-title":"Dynamic-programming-based inequalities for the capacitated lot-sizing problem","volume":"42","author":"Hartman","year":"2010","journal-title":"IIE Trans."},{"issue":"2\u20133","key":"10.1016\/j.cor.2023.106149_b33","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1021805924152","article-title":"Scenario reduction algorithms in stochastic programming","volume":"24","author":"Heitsch","year":"2003","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b34","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","article-title":"Shortest-path network interdiction","volume":"40","author":"Israeli","year":"2002","journal-title":"Networks"},{"key":"10.1016\/j.cor.2023.106149_b35","first-page":"1","article-title":"Scenario generation for stochastic programming introduction and selected methods","volume":"3","author":"Kaut","year":"2011","journal-title":"SINTEF Technol. Soc."},{"key":"10.1016\/j.cor.2023.106149_b36","series-title":"Knapsack Problems","first-page":"235","article-title":"Multidimensional knapsack problems","author":"Kellerer","year":"2004"},{"key":"10.1016\/j.cor.2023.106149_b37","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.mbs.2018.10.010","article-title":"Optimizing multi-modal cancer treatment under 3D spatio-temporal tumor growth","volume":"307","author":"K\u0131b\u0131\u015f","year":"2019","journal-title":"Math. Biosci."},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b38","first-page":"808","article-title":"A multistage stochastic programming approach to the optimal surveillance and control of the emerald ash borer in cities","volume":"33","author":"K\u0131b\u0131\u015f","year":"2021","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"10.1016\/j.cor.2023.106149_b39","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1287\/opre.2013.1182","article-title":"Optimizing trading decisions for hydro storage systems using approximate dual dynamic programming","volume":"61","author":"L\u00f6hndorf","year":"2013","journal-title":"Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2023.106149_b40","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1287\/mnsc.1030.0164","article-title":"A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems","volume":"50","author":"Lulli","year":"2004","journal-title":"Manage. Sci."},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b41","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.6.2.197","article-title":"Inequalities for stochastic linear programming problems","volume":"6","author":"Madansky","year":"1960","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b42","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","article-title":"The 0-1 knapsack problem with a single continuous variable","volume":"85","author":"Marchand","year":"1999","journal-title":"Math. Program."},{"year":"2002","series-title":"Comparison Methods for Stochastic Models and Risks, Vol. 389","author":"M\u00fcller","key":"10.1016\/j.cor.2023.106149_b43"},{"issue":"11","key":"10.1016\/j.cor.2023.106149_b44","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1287\/mnsc.38.11.1642","article-title":"Stochastic network programming for financial planning problems","volume":"38","author":"Mulvey","year":"1992","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b45","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(95)00113-6","article-title":"Lifting cover inequalities for the precedence-constrained knapsack problem","volume":"72","author":"Park","year":"1997","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"10.1016\/j.cor.2023.106149_b46","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10107-017-1224-6","article-title":"Identifying effective scenarios in distributionally robust stochastic programs with total variation distance","volume":"173","author":"Rahimian","year":"2019","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2023.106149_b47","series-title":"Online Optimization of Large Scale Systems","first-page":"581","article-title":"Multistage stochastic integer programs: An introduction","author":"R\u00f6misch","year":"2001"},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b48","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-002-0337-7","article-title":"Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra","volume":"93","author":"Ruszczy\u0144ski","year":"2002","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b49","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/S1052623402410855","article-title":"Risk aversion via excess probabilities in stochastic programs with mixed-integer recourse","volume":"14","author":"Schultz","year":"2003","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cor.2023.106149_b50","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0927-0507(05)12009-X","article-title":"Algorithms for stochastic mixed-integer programming models","volume":"12","author":"Sen","year":"2005","journal-title":"Handbooks Oper. Res. Management Sci."},{"year":"2009","series-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"Shapiro","key":"10.1016\/j.cor.2023.106149_b51"},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b52","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2012.08.022","article-title":"Risk neutral and risk averse stochastic dual dynamic programming method","volume":"224","author":"Shapiro","year":"2013","journal-title":"European J. Oper. Res."},{"year":"2013","series-title":"Non-convexities representation on hydrothermal operation planning using SDDP","author":"Thome","key":"10.1016\/j.cor.2023.106149_b53"},{"issue":"4","key":"10.1016\/j.cor.2023.106149_b54","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10287-010-0125-4","article-title":"Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems","volume":"8","author":"Watson","year":"2011","journal-title":"Comput. Manag. Sci."},{"issue":"2","key":"10.1016\/j.cor.2023.106149_b55","first-page":"739","article-title":"Learning to solve large-scale security-constrained unit commitment problems","volume":"33","author":"Xavier","year":"2021","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2023.106149_b56","article-title":"An expandable learning-optimization framework for sequentially dependent decision-making","author":"Yilmaz","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106149_b57","doi-asserted-by":"crossref","DOI":"10.1080\/24725854.2023.2223246","article-title":"COVID-19: Agent-based simulation-optimization to vaccine center location vaccine allocation problem","author":"Yin","year":"2023","journal-title":"IISE Trans."},{"issue":"3","key":"10.1016\/j.cor.2023.106149_b58","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10729-021-09559-z","article-title":"A multi-stage stochastic programming approach to epidemic resource allocation with equity considerations","volume":"24","author":"Yin","year":"2021","journal-title":"Health Care Manage. Sci."},{"issue":"1","key":"10.1016\/j.cor.2023.106149_b59","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/24725579.2021.1938298","article-title":"Risk-averse multi-stage stochastic programming to optimizing vaccine allocation and treatment logistics for effective epidemic response","volume":"12","author":"Yin","year":"2022","journal-title":"IISE Trans. Healthc. Syst. Eng."},{"key":"10.1016\/j.cor.2023.106149_b60","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ejor.2021.11.052","article-title":"COVID-19: Data-driven optimal allocation of ventilator supply under uncertainty and risk","volume":"304","author":"Yin","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.cor.2023.106149_b61","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10107-018-1249-5","article-title":"Stochastic dual dynamic integer programming","volume":"175","author":"Zou","year":"2019","journal-title":"Math. Program."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823000138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823000138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T21:03:34Z","timestamp":1701723814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823000138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":61,"alternative-id":["S0305054823000138"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106149","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106149","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"106149"}}