{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T14:45:16Z","timestamp":1724424316924},"reference-count":110,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BU 2313\/2"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s13675-018-0103-0","type":"journal-article","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T14:07:49Z","timestamp":1536156469000},"page":"211-238","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Robust combinatorial optimization under convex and discrete cost uncertainty"],"prefix":"10.1016","volume":"6","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[]},{"given":"Jannis","family":"Kurtz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1007\/s13675-018-0103-0_CR1","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.dam.2010.12.018","article-title":"An s-t connection problem with adaptability","volume":"159","author":"Adjiashvili","year":"2011","journal-title":"Discrete Appl Math"},{"issue":"1-2","key":"10.1007\/s13675-018-0103-0_CR2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-014-0760-6","article-title":"Bulk-robust combinatorial optimization","volume":"149","author":"Adjiashvili","year":"2015","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0103-0_CR3","unstructured":"Adjiashvili D, Bindewald V, Michaels D (2016) Robust assignments via ear decompositions and randomized rounding. In: Chatzigiannakis I, Mitzenmacher M, Rabani Y, Sangiorgi D (eds) 43rd international colloquium on automata, languages, and programming (ICALP 2016). Leibniz international proceedings in informatics (LIPIcs), vol 55. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 71:1\u201371:14. 10.4230\/LIPIcs.ICALP.2016.71"},{"key":"10.1007\/s13675-018-0103-0_CR4","unstructured":"Adjiashvili D, Bindewald V, Michaels D (2017) Robust assignments with vulnerable nodes. Technical report. http:\/\/arxiv.org\/abs\/1703.06074"},{"key":"10.1007\/s13675-018-0103-0_CR5","doi-asserted-by":"crossref","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2005a) Approximation complexity of min\u2013max (regret) versions of shortest path, spanning tree, and knapsack. In: Algorithms\u2014ESA 2005. Lecture notes in computer science, vol 3669. Springer, Berlin, pp 862\u2013873","DOI":"10.1007\/11561071_76"},{"issue":"6","key":"10.1007\/s13675-018-0103-0_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","article-title":"Complexity of the min-max and min-max regret assignment problems","volume":"33","author":"Aissi","year":"2005","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-018-0103-0_CR7","doi-asserted-by":"crossref","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2005c) Complexity of the min\u2013max (regret) versions of cut problems. In: Algorithms and computation. Springer, Berlin, pp 789\u2013798","DOI":"10.1007\/11602613_79"},{"key":"10.1007\/s13675-018-0103-0_CR8","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2005d) Pseudo-polynomial algorithms for min\u2013max and min\u2013max regret problems. In: 5th international symposium on operations research and its applications (ISORA 2005), pp 171\u2013178"},{"issue":"2","key":"10.1007\/s13675-018-0103-0_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min-max and min-max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10288-013-0231-6","article-title":"A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems","volume":"11","author":"\u00c1lvarez-Miranda","year":"2013","journal-title":"4OR"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s00453-006-0068-x","article-title":"Multicriteria global minimum cuts","volume":"46","author":"Armon","year":"2006","journal-title":"Algorithmica"},{"key":"10.1007\/s13675-018-0103-0_CR12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-006-0709-5","article-title":"Strong formulations of robust mixed 0-1 programming","volume":"108","author":"Atamt\u00fcrk","year":"2006","journal-title":"Math Program"},{"issue":"5","key":"10.1007\/s13675-018-0103-0_CR13","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.orl.2008.04.006","article-title":"Polymatroids and mean-risk minimization in discrete optimization","volume":"36","author":"Atamt\u00fcrk","year":"2008","journal-title":"Oper Res Lett"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR14","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/opre.1070.0428","article-title":"Two-stage robust network flow and design under demand uncertainty","volume":"55","author":"Atamt\u00fcrk","year":"2007","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","article-title":"Interval data minmax regret network optimization problems","volume":"138","author":"Averbakh","year":"2004","journal-title":"Discrete Appl Math"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ejor.2003.07.007","article-title":"On the complexity of minmax regret linear programming","volume":"160","author":"Averbakh","year":"2005","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13675-018-0103-0_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10287-016-0249-2","article-title":"Decomposition for adjustable robust linear optimization subject to uncertainty polytope","volume":"13","author":"Ayoub","year":"2016","journal-title":"Comput Manag Sci"},{"key":"10.1007\/s13675-018-0103-0_CR18","doi-asserted-by":"crossref","unstructured":"Baumann F, Buchheim C, Ilyina A (2014) Lagrangean decomposition for mean\u2013variance combinatorial optimization. In: Combinatorial optimization\u2014third international symposium, ISCO 2014. lecture notes in computer science, vol 8596. Springer, Berlin, pp 62\u201374","DOI":"10.1007\/978-3-319-09174-7_6"},{"key":"10.1007\/s13675-018-0103-0_CR19","doi-asserted-by":"crossref","unstructured":"Baumann F, Buchheim C, Ilyina A (2015) A Lagrangean decomposition approach for robust combinatorial optimization. Technical report, Optimization online","DOI":"10.1007\/978-3-319-09174-7_6"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR20","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":"Math Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR21","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":"Oper Res Lett"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR22","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","article-title":"Robust optimization-methodology and applications","volume":"92","author":"Ben-Tal","year":"2002","journal-title":"Math Program"},{"issue":"2","key":"10.1007\/s13675-018-0103-0_CR23","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","article-title":"Adjustable robust solutions of uncertain linear programs","volume":"99","author":"Ben-Tal","year":"2004","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR24","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/msom.1050.0081","article-title":"Retailer-supplier flexible commitments contracts: a robust optimization approach","volume":"7","author":"Ben-Tal","year":"2005","journal-title":"Manuf Serv Oper Manag"},{"issue":"12","key":"10.1007\/s13675-018-0103-0_CR25","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/TAC.2010.2049764","article-title":"Finite adaptability in multistage linear optimization","volume":"55","author":"Bertsimas","year":"2010","journal-title":"IEEE Trans autom Control"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR26","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1287\/opre.2016.1515","article-title":"Multistage robust mixed-integer optimization with adaptive partitions","volume":"64","author":"Bertsimas","year":"2016","journal-title":"Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR27","first-page":"1","article-title":"Binary decision rules for multistage adaptive mixed-integer optimization","volume":"167","author":"Bertsimas","year":"2014","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR28","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1287\/opre.2015.1365","article-title":"Design of near optimal decision rules in multistage adaptive mixed-integer optimization","volume":"63","author":"Bertsimas","year":"2015","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR29","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00186-012-0405-6","article-title":"On the approximability of adjustable robust convex optimization under uncertainty","volume":"77","author":"Bertsimas","year":"2013","journal-title":"Math Methods Oper Res"},{"issue":"2","key":"10.1007\/s13675-018-0103-0_CR30","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10287-015-0236-z","article-title":"Reformulation versus cutting-planes for robust optimization","volume":"13","author":"Bertsimas","year":"2016","journal-title":"Comput Manag Sci"},{"issue":"1-3","key":"10.1007\/s13675-018-0103-0_CR31","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":"Math Program"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR32","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":"Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR33","unstructured":"Bertsimas D, Sim M (2004b) Robust discrete optimization under ellipsoidal uncertainty sets. Citeseer"},{"issue":"6","key":"10.1007\/s13675-018-0103-0_CR34","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","article-title":"Robust linear optimization under general norms","volume":"32","author":"Bertsimas","year":"2004","journal-title":"Oper Res Lett"},{"issue":"2","key":"10.1007\/s13675-018-0103-0_CR35","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/moor.1100.0444","article-title":"Optimality of affine policies in multistage robust optimization","volume":"35","author":"Bertsimas","year":"2010","journal-title":"Math Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR36","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","article-title":"Theory and applications of robust optimization","volume":"53","author":"Bertsimas","year":"2011","journal-title":"SIAM Rev"},{"issue":"33","key":"10.1007\/s13675-018-0103-0_CR37","doi-asserted-by":"crossref","first-page":"3190","DOI":"10.1016\/j.cma.2007.03.003","article-title":"Robust optimization\u2014a comprehensive survey","volume":"196","author":"Beyer","year":"2007","journal-title":"Comput Methods Appl Mech Eng"},{"key":"10.1007\/s13675-018-0103-0_CR38","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.dam.2014.01.017","article-title":"2-Stage robust MILP with continuous recourse variables","volume":"170","author":"Billionnet","year":"2014","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-018-0103-0_CR39","doi-asserted-by":"crossref","unstructured":"Buchheim C, Kurtz J (2016) Min\u2013max\u2013min robust combinatorial optimization subject to discrete uncertainty. Optimization online","DOI":"10.1007\/s10107-016-1053-z"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1053-z","article-title":"Min-max-min robust combinatorial optimization","volume":"163","author":"Buchheim","year":"2017","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0103-0_CR41","unstructured":"Buchheim C, De Santis M, Rinaldi F, Trieu L (2015) A Frank\u2013Wolfe based branch-and-bound algorithm for mean-risk optimization. Technical report, Optimization online"},{"key":"10.1007\/s13675-018-0103-0_CR42","unstructured":"B\u00fcsing C (2011) Recoverable robustness in combinatorial optimization. Ph.D. thesis, Technical University of Berlin"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR43","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.20487","article-title":"Recoverable robust shortest path problems","volume":"59","author":"B\u00fcsing","year":"2012","journal-title":"Networks"},{"key":"10.1007\/s13675-018-0103-0_CR44","doi-asserted-by":"crossref","unstructured":"B\u00fcsing C, D\u2019Andreagiovanni F (2012) New results about multi-band uncertainty in robust optimization. In: International symposium on experimental algorithms. Springer, Berlin, pp 63\u201374","DOI":"10.1007\/978-3-642-30850-5_7"},{"key":"10.1007\/s13675-018-0103-0_CR45","doi-asserted-by":"crossref","unstructured":"B\u00fcsing C, D\u2019Andreagiovanni F (2013) Robust optimization under multi-band uncertainty\u2014part I: theory. arXiv preprint arXiv:1301.2734","DOI":"10.1007\/978-3-319-00795-3_17"},{"key":"10.1007\/s13675-018-0103-0_CR46","doi-asserted-by":"crossref","unstructured":"B\u00fcsing C, Koster A, Kutschka M (2011a) Recoverable robust knapsacks: \u03b3-scenarios. Network optimization. Springer, Berlin, pp 583\u2013588","DOI":"10.1007\/978-3-642-21527-8_65"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR47","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11590-011-0307-1","article-title":"Recoverable robust knapsacks: the discrete scenario case","volume":"5","author":"B\u00fcsing","year":"2011","journal-title":"Optim Lett"},{"issue":"10","key":"10.1007\/s13675-018-0103-0_CR48","doi-asserted-by":"crossref","first-page":"2463","DOI":"10.1016\/j.automatica.2008.02.007","article-title":"Multi-period portfolio optimization with linear control policies","volume":"44","author":"Calafiore","year":"2008","journal-title":"automatica"},{"key":"10.1007\/s13675-018-0103-0_CR49","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","article-title":"Heuristics for cardinality constrained portfolio optimisation","volume":"27","author":"Chang","year":"2000","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR50","unstructured":"Chassein A, Goerigk M (2016) Min\u2013max regret problems with ellipsoidal uncertainty sets. arXiv preprint arXiv:1606.01180"},{"key":"10.1007\/s13675-018-0103-0_CR51","doi-asserted-by":"crossref","unstructured":"Chassein A, Goerigk M, Kasperski A, Zieli\u0144ski P (2017) On recoverable and two-stage robust selection problems with budgeted uncertainty. arXiv preprint arXiv:1701.06064","DOI":"10.1016\/j.ejor.2017.08.013"},{"issue":"6","key":"10.1007\/s13675-018-0103-0_CR52","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1287\/opre.1080.0605","article-title":"Uncertain linear programs: extended affinely adjustable robust counterparts","volume":"57","author":"Chen","year":"2009","journal-title":"Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR53","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.disopt.2015.09.007","article-title":"The multi-band robust knapsack problem\u2014a dynamic programming approach","volume":"18","author":"Cla\u00dfen","year":"2015","journal-title":"Discrete Optim"},{"key":"10.1007\/s13675-018-0103-0_CR54","series-title":"Optimization methods in finance","author":"Cornuejols","year":"2006"},{"key":"10.1007\/s13675-018-0103-0_CR55","unstructured":"Corporation I (2015) IBM ILOG CPLEX optimization studio: CPLEX user\u2019s manual. https:\/\/www.ibm.com\/us-en\/marketplace\/ibm-ilog-cplex"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR56","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","article-title":"Robust solutions to least-squares problems with uncertain data","volume":"18","author":"El Ghaoui","year":"1997","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR57","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","article-title":"Robust solutions to uncertain semidefinite programs","volume":"9","author":"El Ghaoui","year":"1998","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-018-0103-0_CR58","doi-asserted-by":"crossref","unstructured":"Feige U, Jain K, Mahdian M, Mirrokni V (2007) Robust combinatorial optimization with exponential scenarios. In: Integer programming and combinatorial optimization, pp 439\u2013453","DOI":"10.1007\/978-3-540-72792-7_33"},{"key":"10.1007\/s13675-018-0103-0_CR59","doi-asserted-by":"crossref","unstructured":"Fischetti M, Monaci M (2009) Light robustness. In: Ahuja RK, M\u00f6hring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Springer, Berlin, pp 61\u201384","DOI":"10.1007\/978-3-642-05465-5_3"},{"key":"10.1007\/s13675-018-0103-0_CR60","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-012-0039-y","article-title":"Cutting plane versus compact formulations for uncertain (integer) linear programs","volume":"4","author":"Fischetti","year":"2012","journal-title":"Math Program Comput"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR61","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/trsc.1090.0264","article-title":"Fast approaches to improve the robustness of a railway timetable","volume":"43","author":"Fischetti","year":"2009","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR62","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","article-title":"Recent advances in robust optimization: an overview","volume":"235","author":"Gabrel","year":"2014","journal-title":"Eur J Oper Res"},{"issue":"1-2","key":"10.1007\/s13675-018-0103-0_CR63","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0789-6","article-title":"Generalized decision rule approximations for stochastic programming via liftings","volume":"152","author":"Georghiou","year":"2015","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0103-0_CR64","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.omega.2014.12.006","article-title":"A practical guide to robust optimization","volume":"53","author":"Gorissen","year":"2015","journal-title":"Omega"},{"key":"10.1007\/s13675-018-0103-0_CR65","series-title":"Geometric algorithms and combinatorial optimization","author":"Gr\u00f6tschel","year":"1993"},{"key":"10.1007\/s13675-018-0103-0_CR66","unstructured":"Gurobi Optimization I (2016) Gurobi optimizer reference manual. http:\/\/www.gurobi.com. Accessed 3 Sept 2018"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR67","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1287\/opre.2015.1392","article-title":"K-Adaptability in two-stage robust binary programming","volume":"63","author":"Hanasusanto","year":"2015","journal-title":"Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR68","doi-asserted-by":"crossref","unstructured":"Hradovich M, Kasperski A, Zieli\u0144ski P (2016) The robust recoverable spanning tree problem with interval costs is polynomially solvable. arXiv preprint arXiv:1602.07422","DOI":"10.1007\/s11590-016-1057-x"},{"key":"10.1007\/s13675-018-0103-0_CR69","unstructured":"Iancu DA (2010) Adaptive robust optimization with applications in inventory and revenue management. Ph.D. thesis, Massachusetts Institute of Technology"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR70","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.2013.1172","article-title":"Supermodularity and affine policies in dynamic robust optimization","volume":"61","author":"Iancu","year":"2013","journal-title":"Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR71","unstructured":"Ilyina A (2017) Combinatorial optimization under ellipsoidal uncertainty. Ph.D. thesis, TU Dortmund University"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR72","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/0377-2217(94)00092-Q","article-title":"Minimax regret solution to linear programming problems with an interval objective function","volume":"86","author":"Inuiguchi","year":"1995","journal-title":"Eur J Oper Res"},{"issue":"4-5","key":"10.1007\/s13675-018-0103-0_CR73","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.tcs.2010.10.006","article-title":"On the approximability of robust spanning tree problems","volume":"412","author":"Kasperski","year":"2011","journal-title":"Theor Comput Sci"},{"key":"10.1007\/s13675-018-0103-0_CR74","unstructured":"Kasperski A, Zieli\u0144ski P (2015) Robust recoverable and two-stage selection problems. arXiv preprint arXiv:1505.06893"},{"key":"10.1007\/s13675-018-0103-0_CR75","doi-asserted-by":"crossref","unstructured":"Kasperski A, Zieli\u0144ski P (2016) Robust discrete optimization under discrete and interval uncertainty: a survey. In: Doumpos M, Zopounidis C, Grigoroudis E (eds) Robustness analysis in decision aiding, optimization, and analytics. Springer, Berlin, pp 113\u2013143","DOI":"10.1007\/978-3-319-33121-8_6"},{"key":"10.1007\/s13675-018-0103-0_CR76","doi-asserted-by":"crossref","unstructured":"Kasperski A, Zieli\u0144ski P (2017) Robust two-stage network problems. In: Operations research proceedings 2015. Springer, Berlin, pp 35\u201340","DOI":"10.1007\/978-3-319-42902-1_5"},{"key":"10.1007\/s13675-018-0103-0_CR77","doi-asserted-by":"crossref","unstructured":"Kasperski A, Kurpisz A, Zieli\u0144ski P (2014) Recoverable robust combinatorial optimization problems. In: Operations research proceedings 2012. Springer, Berlin, pp 147\u2013153","DOI":"10.1007\/978-3-319-00795-3_22"},{"key":"10.1007\/s13675-018-0103-0_CR78","series-title":"Knapsack problems","author":"Kellerer","year":"2004"},{"key":"10.1007\/s13675-018-0103-0_CR79","first-page":"589","article-title":"Two-stage robust network design with exponential scenarios","volume":"2008","author":"Khandekar","year":"2008","journal-title":"Algorithms ESA"},{"key":"10.1007\/s13675-018-0103-0_CR80","series-title":"Robust discrete optimization and its applications","author":"Kouvelis","year":"1996"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR81","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-009-0331-4","article-title":"Primal and dual linear decision rules in stochastic and robust optimization","volume":"130","author":"Kuhn","year":"2011","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0103-0_CR82","unstructured":"Kurtz J (2016) Min\u2013max\u2013min robust combinatorial optimization. Ph.D. thesis, TU Dortmund University"},{"key":"10.1007\/s13675-018-0103-0_CR83","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.compchemeng.2018.01.006","article-title":"Robust optimization for decision-making under endogenous uncertainty","volume":"111","author":"Lappas","year":"2018","journal-title":"Comput Chem Eng"},{"issue":"4","key":"10.1007\/s13675-018-0103-0_CR84","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10288-014-0270-7","article-title":"A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty","volume":"12","author":"Lee","year":"2014","journal-title":"4OR"},{"issue":"18","key":"10.1007\/s13675-018-0103-0_CR85","doi-asserted-by":"crossref","first-page":"10567","DOI":"10.1021\/ie200150p","article-title":"A comparative theoretical and computational study on robust counterpart optimization: I. Robust linear optimization and robust mixed integer linear optimization","volume":"50","author":"Li","year":"2011","journal-title":"Ind Eng Chem Res"},{"key":"10.1007\/s13675-018-0103-0_CR86","doi-asserted-by":"crossref","unstructured":"Liebchen C, L\u00fcbbecke M, M\u00f6hring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja R, M\u00f6hring R, Zaroliagis C (eds) Robust and online large-scale optimization. Springer, Berlin, pp 1\u201327","DOI":"10.1007\/978-3-642-05465-5_1"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR87","first-page":"77","article-title":"Portfolio selection","volume":"7","author":"Markowitz","year":"1952","journal-title":"J Finance"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR88","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10898-010-9645-2","article-title":"On 2-stage robust LP with RHS uncertainty: complexity results and applications","volume":"49","author":"Minoux","year":"2011","journal-title":"J Glob Optim"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR89","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10898-015-0280-9","article-title":"Constrained shortest path with uncertain transit times","volume":"63","author":"Mokarami","year":"2015","journal-title":"J Glob Optim"},{"issue":"11","key":"10.1007\/s13675-018-0103-0_CR90","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1016\/j.cor.2013.05.005","article-title":"Exact solution of the robust knapsack problem","volume":"40","author":"Monaci","year":"2013","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR91","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1080\/10556780802712889","article-title":"Cutting-set methods for robust convex optimization with pessimizing oracles","volume":"24","author":"Mutapcic","year":"2009","journal-title":"Optim Methods Softw"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR92","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1287\/ijoc.2015.0671","article-title":"Robust critical node selection by benders decomposition","volume":"28","author":"Naoum-Sawaya","year":"2016","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-018-0103-0_CR93","unstructured":"Nasrabadi E, Orlin JB (2013) Robust optimization with incremental recourse. arXiv preprint arXiv:1312.4075"},{"key":"10.1007\/s13675-018-0103-0_CR94","doi-asserted-by":"crossref","unstructured":"Nikolova E (2010a) Approximation algorithms for offline risk-averse combinatorial optimization. Technical report","DOI":"10.1007\/978-3-642-15369-3_26"},{"key":"10.1007\/s13675-018-0103-0_CR95","doi-asserted-by":"crossref","unstructured":"Nikolova E (2010b) Approximation algorithms for reliable stochastic combinatorial optimization. In: Serna M, Shaltiel R, Jansen K, Rolim J (eds) Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Springer, Berlin, pp 338\u2013351","DOI":"10.1007\/978-3-642-15369-3_26"},{"key":"10.1007\/s13675-018-0103-0_CR96","unstructured":"Nohadani O, Sharma K (2016) Optimization under decision-dependent uncertainty. arXiv preprint arXiv:1611.07992"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR97","first-page":"115","article-title":"A note on robust combinatorial optimization problem","volume":"13","author":"Park","year":"2007","journal-title":"Manag Sci Financ Eng"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR98","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/ijoc.2015.0643","article-title":"Robust network design with uncertain outsourcing cost","volume":"27","author":"Pessoa","year":"2015","journal-title":"INFORMS J Comput"},{"issue":"1","key":"10.1007\/s13675-018-0103-0_CR99","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10288-012-0217-9","article-title":"Robust combinatorial optimization with variable budgeted uncertainty","volume":"11","author":"Poss","year":"2013","journal-title":"4OR"},{"key":"10.1007\/s13675-018-0103-0_CR100","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.disopt.2017.09.004","article-title":"Robust combinatorial optimization with knapsack uncertainty","volume":"27","author":"Poss","year":"2017","journal-title":"Discrete Optim"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR101","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/ijoc.2016.0696","article-title":"Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set","volume":"28","author":"Postek","year":"2016","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-018-0103-0_CR102","first-page":"99","article-title":"Benders decomposition approach to robust mixed integer programming","volume":"3","author":"Saito","year":"2007","journal-title":"Pac J Optim"},{"key":"10.1007\/s13675-018-0103-0_CR103","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00186-014-0474-9","article-title":"Generalized light robustness and the trade-off between robustness and nominal quality","volume":"80","author":"Sch\u00f6bel","year":"2014","journal-title":"Math Methods Oper Res"},{"issue":"2","key":"10.1007\/s13675-018-0103-0_CR104","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.orl.2011.01.001","article-title":"A dynamic programming approach to adjustable robust optimization","volume":"39","author":"Shapiro","year":"2011","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-018-0103-0_CR105","unstructured":"Sim M (2004) Robust optimization. Ph.D. thesis, Massachusetts Institute of Technology"},{"issue":"5","key":"10.1007\/s13675-018-0103-0_CR106","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":"Oper Res"},{"key":"10.1007\/s13675-018-0103-0_CR107","unstructured":"Subramanyam A, Gounaris CE, Wiesemann W (2017) K-Adaptability in two-stage mixed-integer robust optimization. arXiv preprint arXiv:1706.07097"},{"issue":"3","key":"10.1007\/s13675-018-0103-0_CR108","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.automatica.2011.12.002","article-title":"A constraint sampling approach for multi-stage robust optimization","volume":"48","author":"Vayanos","year":"2012","journal-title":"automatica"},{"key":"10.1007\/s13675-018-0103-0_CR109","unstructured":"Yan\u0131ko\u011flu \u0130, Gorissen B, den Hertog D (2017) Adjustable robust optimization\u2014a survey and tutorial. ResearchGate"},{"issue":"5","key":"10.1007\/s13675-018-0103-0_CR110","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","article-title":"Solving two-stage robust optimization problems using a column-and-constraint generation method","volume":"41","author":"Zeng","year":"2013","journal-title":"Oper Res Lett"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0103-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0103-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0103-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:30:52Z","timestamp":1648632652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":110,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S2192440621001015"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0103-0","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"24 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}