{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T15:58:04Z","timestamp":1723132684352},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2019.01.043","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T09:45:56Z","timestamp":1548150356000},"page":"451-465","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Almost Robust Discrete Optimization"],"prefix":"10.1016","volume":"276","author":[{"given":"Opher","family":"Baron","sequence":"first","affiliation":[]},{"given":"Oded","family":"Berman","sequence":"additional","affiliation":[]},{"given":"Mohammad M.","family":"Fazel-Zarandi","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9825-5743","authenticated-orcid":false,"given":"Vahid","family":"Roshanaei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2019.01.043_bib0001","unstructured":"Ahmed, S., & Shapiro, A. (2002). The sample average approximation method for stochastic programs with integer recourse. https:\/\/www.researchgate.net\/profile\/Shabbir_Ahmed6\/publication\/200035231_The_sample_average_approximation_method_for_stochastic_programs_with_integer_recourse_Submitted_for_publication\/links\/00b4952c302ca74f55000000.pdf."},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0002","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-006-0709-5","article-title":"Strong formulations of robust mixed 0\u20131 programming","volume":"108","author":"Atamt\u00fcrk","year":"2006","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0003","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","article-title":"On the complexity of a class of combinatorial optimization problems with uncertainty","volume":"90","author":"Averbakh","year":"2001","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0004","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Mathematical Programming"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.043_bib0005","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1111\/j.1937-5956.2010.01194.x","article-title":"Facility location: A robust optimization approach","volume":"20","author":"Baron","year":"2011","journal-title":"Production and Operations Management"},{"issue":"4-part-2","key":"10.1016\/j.ejor.2019.01.043_bib0006","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1287\/opre.1100.0821","article-title":"A soft robust model for optimization under ambiguity","volume":"58","author":"Ben-Tal","year":"2010","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0007","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10107-005-0679-z","article-title":"Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems","volume":"107","author":"Ben-Tal","year":"2006","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0008","first-page":"63","article-title":"Robust optimization","volume":"107","author":"Ben-Tal","year":"2009","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.043_bib0009","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","article-title":"Robust convex optimization","volume":"23","author":"Ben-Tal","year":"1998","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","article-title":"Robust solutions of uncertain linear programs","volume":"25","author":"Ben-Tal","year":"1999","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2019.01.043_bib0011","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische Mathematik"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0012","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/opre.1060.0348","article-title":"Facility reliability issues in network p-median problems: Strategic centralization and co-location effects","volume":"55","author":"Berman","year":"2007","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.043_bib0013","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1137\/S1052623401399903","article-title":"Optimal inequalities in probability theory: A convex optimization approach","volume":"15","author":"Bertsimas","year":"2005","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0014","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0015","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The price of robustness","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2019.01.043_bib0016","unstructured":"Bertsimas, D., & Sim, M. (2004b). Robust discrete optimization under ellipsoidal uncertainty sets. Working paper, (pp. 1\u201323)."},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0017","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00934096","article-title":"Infinitely constrained optimization problems","volume":"19","author":"Blankenship","year":"1976","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0018","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","article-title":"Chance-constrained programming","volume":"6","author":"Charnes","year":"1959","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0019","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.1080.0570","article-title":"Goal-driven optimization","volume":"57","author":"Chen","year":"2009","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2019.01.043_bib0020","series-title":"In financial optimization","first-page":"290","article-title":"Scenario immunization","author":"Demb","year":"1992"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.043_bib0021","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02025089","article-title":"Production planning via scenario modelling","volume":"43","author":"Escudero","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"8","key":"10.1016\/j.ejor.2019.01.043_bib0022","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1080\/0740817X.2012.705452","article-title":"Solving a stochastic facility location\/fleet management problem with logic-based Benders decomposition","volume":"45","author":"Fazel-Zarandi","year":"2013","journal-title":"IIE Transactions"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.043_bib0023","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1111\/poms.12657","article-title":"Multistage stochastic optimization for production-inventory planning with intermittent renewable energy","volume":"26","author":"Golari","year":"2017","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.ejor.2019.01.043_bib0024","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10287-005-0007-3","article-title":"Integrated chance constraints: reduced forms and an algorithm","volume":"3","author":"Haneveld","year":"2006","journal-title":"Computational Management Science"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0025","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","article-title":"Logic-based Benders decomposition","volume":"96","author":"Hooker","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2019.01.043_bib0026","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-642-51697-9_5","article-title":"On integrated chance constraints","author":"Klein Haneveld","year":"1986","journal-title":"Duality in stochastic linear and dynamic programming"},{"key":"10.1016\/j.ejor.2019.01.043_bib0027","series-title":"Robust discrete optimization and its applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.043_bib0028","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","article-title":"The integer l-shaped method for stochastic integer programs with complete recourse","volume":"13","author":"Laporte","year":"1993","journal-title":"Operations Research Letters"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.043_bib0029","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/msom.2015.0541","article-title":"Reliable facility location design under uncertain correlated disruptions","volume":"17","author":"Lu","year":"2015","journal-title":"Manufacturing & Service Operations Management"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0030","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","article-title":"Robust optimization of large-scale systems","volume":"43","author":"Mulvey","year":"1995","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.043_bib0031","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1287\/opre.1080.0683","article-title":"Constructing risk measures from uncertainty sets","volume":"57","author":"Natarajan","year":"2009","journal-title":"Operations research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0032","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00291-005-0023-2","article-title":"Robust scenario optimization based on downside-risk measure for multi-period portfolio selection","volume":"29","author":"P\u0131nar","year":"2007","journal-title":"OR Spectrum"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0033","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/opre.1060.0353","article-title":"Robust mean-covariance solutions for stochastic optimization","volume":"55","author":"Popescu","year":"2007","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.043_bib0034","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.ejor.2016.08.024","article-title":"Propagating logic-based Benders\u2019 decomposition approaches for distributed operating room scheduling","volume":"257","author":"Roshanaei","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.043_bib0035","series-title":"Stochastic programming","first-page":"1","article-title":"Stochastic programming models","volume":"10","author":"Ruszczy\u0144ski","year":"2003"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.043_bib0036","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","article-title":"Convex programming with set-inclusive constraints and applications to inexact linear programming","volume":"21","author":"Soyster","year":"1973","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.043_bib0037","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10107-003-0373-y","article-title":"On robust optimization of two-stage systems","volume":"99","author":"Takriti","year":"2004","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300785?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300785?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T07:35:58Z","timestamp":1551944158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221719300785"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.043","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Almost Robust Discrete Optimization","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.043","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}