{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:15:53Z","timestamp":1775099753669,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11590-017-1206-x","type":"journal-article","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T20:48:16Z","timestamp":1508791696000},"page":"1523-1533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On scenario aggregation to approximate robust combinatorial optimization problems"],"prefix":"10.1007","volume":"12","author":[{"given":"Andr\u00e9","family":"Chassein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2516-0129","authenticated-orcid":false,"given":"Marc","family":"Goerigk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"issue":"2","key":"1206_CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2006.03.023","volume":"179","author":"H Aissi","year":"2007","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Approximation of min\u2013max and min\u2013max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179(2), 281\u2013290 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1206_CR2","doi-asserted-by":"crossref","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.: Min\u2013max and min\u2013max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427\u2013438 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1206_CR3","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.ejor.2015.02.023","volume":"244","author":"A Chassein","year":"2015","unstructured":"Chassein, A., Goerigk, M.: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. 244(3), 739\u2013747 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1206_CR4","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.ejor.2012.01.005","volume":"219","author":"E Conde","year":"2012","unstructured":"Conde, E.: On a constant factor approximation for minmax regret problems using a symmetry point scenario. Eur. J. Oper. Res. 219(2), 452\u2013457 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1206_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht Boston (1997)"},{"issue":"5","key":"1206_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A Kasperski","year":"2006","unstructured":"Kasperski, A., Zieli\u0144ski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5), 177\u2013180 (2006)","journal-title":"Inf. Process. Lett."},{"key":"1206_CR7","unstructured":"Kasperski, A., Zieli\u0144ski, P.: Approximation of min\u2013max (regret) combinatorial optimization problems under discrete scenario representation. Technical report, Institute of Mathematics and Computer Science, Wroclaw University of Science and Technology, PRE 7 (2007)"},{"key":"1206_CR8","doi-asserted-by":"crossref","unstructured":"Kasperski, A., Zieli\u0144ski, P.: 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, pp. 113\u2013143. Springer (2016)","DOI":"10.1007\/978-3-319-33121-8_6"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1206-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1206-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1206-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T21:58:19Z","timestamp":1570226299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1206-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":8,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1206"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1206-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,23]]}}}