{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:21:59Z","timestamp":1761294119219},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00186-020-00712-y","type":"journal-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T12:03:44Z","timestamp":1589889824000},"page":"249-283","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Min max min robust (relative) regret combinatorial optimization"],"prefix":"10.1007","volume":"92","author":[{"given":"Alejandro","family":"Crema","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,19]]},"reference":[{"issue":"2","key":"712_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2009) Min\u2013max and min\u2013max regret versions of combinatorial optimization problems: a survey. Eur J Oper Res 197(2):427\u2013438","journal-title":"Eur J Oper Res"},{"key":"712_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.disopt.2005.07.001","volume":"2","author":"I Averbakh","year":"2005","unstructured":"Averbakh I (2005) Computing and minimizing the relative regret in combinatorial optimization with interval data. Discrete Optim 2:273\u2013287","journal-title":"Discrete Optim"},{"issue":"1","key":"712_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1057\/jors.1984.6","volume":"35","author":"TB Boffey","year":"1984","unstructured":"Boffey TB, Karkazis J (1984) p-Medians and multi-medians. J Oper Res Soc 35(1):57\u201364","journal-title":"J Oper Res Soc"},{"key":"712_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.endm.2016.03.007","volume":"52","author":"C Buchheim","year":"2016","unstructured":"Buchheim C, Kurtz J (2016) Min\u2013max\u2013min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. Electron Not Discrete Math 52:45\u201352","journal-title":"Electron Not Discrete Math"},{"issue":"1\u20132","key":"712_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1053-z","volume":"163","author":"C Buchheim","year":"2017","unstructured":"Buchheim C, Kurtz J (2017) Min\u2013max\u2013min robust combinatorial optimization. Math Program 163(1\u20132):1\u201323","journal-title":"Math Program"},{"issue":"2","key":"712_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.ejor.2019.05.045","volume":"279","author":"A Chassein","year":"2019","unstructured":"Chassein A, Goerigk M, Kurtz J, Poss M (2019) Faster algorithms for min\u2013max\u2013min robustness for combinatorial problems with budgeted uncertainty. Eur J Oper Res 279(2):308\u2013319","journal-title":"Eur J Oper Res"},{"key":"712_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1051\/ro\/2011111","volume":"45","author":"A Candia-V\u00e9jar","year":"2011","unstructured":"Candia-V\u00e9jar A, Alvarez-Miranda E, Maculan N (2011) Minmax regret combinatorial optimization problems: an alogorithmic perspective. RAIRO-Oper Res 45:101\u2013129","journal-title":"RAIRO-Oper Res"},{"key":"712_CR8","volume-title":"Fuzzy reasoning in decision making and optimization. Physica","author":"C Carlsson","year":"2012","unstructured":"Carlsson C, Fuller R (2012) Fuzzy reasoning in decision making and optimization. Physica, vol 82. Springer, Berlin"},{"key":"712_CR9","volume-title":"Robustness analysis in decision aiding, optimization, and analytics. International series in operations research and management science","author":"A Chassein","year":"2016","unstructured":"Chassein A, Goerigk M (2016) Performance analysis in robust optimization. In: Doumpos M, Zopounidis C, Grigoroudis E (eds) Robustness analysis in decision aiding, optimization, and analytics. International series in operations research and management science, vol 241. Springer, Cham"},{"key":"712_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/S0377-2217(99)00193-9","volume":"125","author":"A Crema","year":"2000","unstructured":"Crema A (2000) An algorithm for the multiparametric 0\u20131-integer linear programming problem relative to the objective function. Eur J Oper Res 125:18\u201324","journal-title":"Eur J Oper Res"},{"key":"712_CR11","unstructured":"Crema A (2014) Mathematical programming approach to tighten a Big-$$M$$ formulation. www.optimization-online.org. Accessed Aug 2014"},{"issue":"4","key":"712_CR12","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1287\/opre.2015.1392","volume":"63","author":"G Hanasusanto","year":"2015","unstructured":"Hanasusanto G, Kuhn D, Wiesemann W (2015) K-adaptability in two-stage robust binary programming. Oper Res 63(4):877\u2013891","journal-title":"Oper Res"},{"key":"712_CR13","volume-title":"Robustness analysis in decision aiding, optimization, and analytics. International series in operations research and management science","author":"A Kasperski","year":"2016","unstructured":"Kasperski A, Zielinski 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. International series in operations research and management science. Springer, Berlin"},{"key":"712_CR14","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. Springer, Berlin"},{"issue":"1","key":"712_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40305-015-0116-9","volume":"4","author":"J Li","year":"2016","unstructured":"Li J, Liu Y (2016) Approximation algorithms for stochastic combinatorial optimization problems. J Oper Res Soc China 4(1):1\u201347","journal-title":"J Oper Res Soc China"},{"issue":"4","key":"712_CR16","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo N (1979) Combinatorial optimization with fractional objective functions. Math Oper Res 4(4):414\u2013424","journal-title":"Math Oper Res"},{"key":"712_CR17","first-page":"315","volume":"3","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM (2005) The robust shortest path problem with interval data via Benders decomposition. 4 OR 3:315\u2013328","journal-title":"4 OR"},{"key":"712_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cherd.2016.09.034","volume":"116","author":"R Oberdieck","year":"2016","unstructured":"Oberdieck R, Diangelakis NA, Nascu I, Papathanasiou MM, Sun M, Avraamidou S, Pistikopoulos EN (2016) On multi-parametric programming and its applications in process systems engineering. Chem Eng Res Des 116:61\u201382","journal-title":"Chem Eng Res Des"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00712-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-020-00712-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00712-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:17:03Z","timestamp":1621379823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-020-00712-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,19]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["712"],"URL":"https:\/\/doi.org\/10.1007\/s00186-020-00712-y","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,19]]},"assertion":[{"value":"20 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}