{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:02:40Z","timestamp":1762430560405},"reference-count":67,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1051\/ro\/2011111","type":"journal-article","created":{"date-parts":[[2011,8,24]],"date-time":"2011-08-24T09:25:40Z","timestamp":1314177940000},"page":"101-129","source":"Crossref","is-referenced-by-count":19,"title":["Minmax regret combinatorial optimization problems: an Algorithmic Perspective"],"prefix":"10.1051","volume":"45","author":[{"given":"Alfredo","family":"Candia-V\u00e9jar","sequence":"first","affiliation":[]},{"given":"Eduardo","family":"\u00c1lvarez-Miranda","sequence":"additional","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,8,24]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","volume":"33","author":"Aissi","year":"2005","journal-title":"Oper. Res. Lett."},{"key":"R2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2006.03.023","volume":"179","author":"Aissi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1007\/11561071_76","volume":"3669","author":"Aissi","year":"2005","journal-title":"Lect. Notes Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"R5","unstructured":"M.A. Aloulou, R. Kalai and D. Vanderpooten,Minmax regret 1-center problem on a network with a discrete set of scenarios. Lamsade technical Report No. 132, LAMSADE, Universit\u00e9 Paris-Dauphine, Cahier du LAMSADE (2006)."},{"key":"R6","unstructured":"E. Alvarez-Miranda and A. Candia-Vejar, Robust Shortest Path: Models, Algorithms and Comparisons,Proceedings of the VI ALIO\/EURO Workshop on Applied Combinatorial Optimization. Buenos Aires, Argentina (2008)."},{"key":"R7","unstructured":"I. Aron and P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree with interval data,Proceedings of the International Conference on Uncertainty in Artificial Intelligence UAI(2002) 18\u201325."},{"key":"R8","unstructured":"I. Aron and P. Van Hentenryck, On the complexity of the robust spanning tree problem with interval data,Oper. Res. Lett.32(2004) 36\u201340."},{"key":"R9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10957-007-9334-6","volume":"137","author":"Assavapokee","year":"2008","journal-title":"J. Optim. Theory Appl."},{"key":"R10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"Averbakh","year":"2001","journal-title":"Math. Program. Ser. A"},{"key":"R11","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/S0166-218X(02)00384-0","volume":"127","author":"Averbakh","year":"2003","journal-title":"Discr. App. Math."},{"key":"R12","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S0167-6377(03)00091-9","volume":"32","author":"Averbakh","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"R13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.disopt.2005.07.001","volume":"2","author":"Averbakh","year":"2005","journal-title":"Discr. Optim."},{"key":"R14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.disopt.2004.12.001","volume":"2","author":"Averbakh","year":"2005","journal-title":"Discret. Optim."},{"key":"R15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","volume":"12","author":"Averbakh","year":"2000","journal-title":"ORSA J. Comput."},{"key":"R16","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","volume":"123","author":"Averbakh","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"Averbakh","year":"2004","journal-title":"Discr. App. Math."},{"key":"R18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ejor.2003.07.007","volume":"160","author":"Averbakh","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"R19","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"R20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Math. Program. Ser. B"},{"key":"R21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Oper. Res."},{"key":"R22","unstructured":"L. Bianchi, M. Dorigo, L. Gambardella and W. Gutjahr,Metaheuristics in Stochastic Combinatorial Optimization: a Survey.IDSIA Technical Report, IDSIA-08-06 (2006),Natural Computing8(2009) 239\u2013287."},{"key":"R23","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"Burkard","year":"2004","journal-title":"Disc. Appl. Math."},{"key":"R24","unstructured":"A. Candia-V\u00e9jar and E. \u00c1lvarez-Miranda, On a class of interval data minmax regret CO problems.2007(2007) 123\u2013128."},{"key":"R25","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1007\/s00267-005-0292-1","volume":"38","author":"Chang","year":"2006","journal-title":"Environ. Manag."},{"key":"R26","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.wasman.2006.05.002","volume":"27","author":"Chang","year":"2007","journal-title":"Waste Manag."},{"key":"R27","unstructured":"X. Chen, J. Hu and X. Hu, On the minimum risk-sum path problem,ESCAPE'07 Proceedings, Lect. Notes Comput. Sci.4614(2007) 175\u2013185."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"X. Chen, J. Hu and X. Hu, The minimum risk spanning tree problem,COCOA'07 Proceedings, Lecture Notes in Computer Science4616(2007) 81\u201390.","DOI":"10.1007\/978-3-540-73556-4_11"},{"key":"R29","doi-asserted-by":"crossref","first-page":"1893","DOI":"10.1016\/j.cor.2008.06.002","volume":"39","author":"Chen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-003-0474-7","volume":"100","author":"Conde","year":"2001","journal-title":"Math. Program. Ser. A"},{"key":"R31","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.orl.2004.11.003","volume":"33","author":"Conde","year":"2005","journal-title":"Oper. Res. Lett."},{"key":"R32","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/j.ejor.2005.11.040","volume":"179","author":"Conde","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10898-006-9074-4","volume":"37","author":"Conde","year":"2007","journal-title":"J. Glob. Optim."},{"key":"R34","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.orl.2007.05.009","volume":"36","author":"Conde","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"R35","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.orl.2010.03.002","volume":"38","author":"Conde","year":"2010","journal-title":"Oper. Res. Lett."},{"key":"R36","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/j.ejor.2006.07.036","volume":"182","author":"Conde","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R37","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res."},{"key":"R38","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.orl.2005.04.003","volume":"34","author":"Deineko","year":"2006","journal-title":"Oper. Res. Lett."},{"key":"R39","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1080\/07408170590918164","volume":"37","author":"Demir","year":"2005","journal-title":"IIE Trans."},{"key":"R40","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.ejor.2005.01.031","volume":"174","author":"Hites","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"R41","unstructured":"O. Karasan, M. Pinar and H. Yaman,The Robust Shortest Path Problem with Interval Data. Technical Report Bilkent University (2001), revised (2004)."},{"key":"R42","unstructured":"A. Kasperski,Discrete Optimization with Interval Data: Minmax Regret and Fuzzy Approach. Studies in Fuzzines and Soft Computing, Springer (2008)."},{"key":"R43","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"Kasperski","year":"2006","journal-title":"Inf. Process. Lett."},{"key":"R44","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.orl.2005.01.008","volume":"34","author":"Kasperski","year":"2006","journal-title":"Oper. Res. Lett."},{"key":"R45","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.ejor.2005.12.033","volume":"177","author":"Kasperski","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R46","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1057\/palgrave.jors.2602284","volume":"58","author":"Kazakci","year":"2007","journal-title":"J. Oper. Res. Soc."},{"key":"R47","doi-asserted-by":"crossref","unstructured":"P. Kouvelis and G. Yu,Robust discrete optimization and its applications. Kluwer Academic Publishers (1997).","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"R48","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0167-6377(99)00049-8","volume":"25","author":"Loulou","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"R49","unstructured":"T.L. Magnanti and L. Wolsey, optimal trees, network models, inHandbook in Operations research and management science7, edited by M.O. Ballet\u00a0al., North-Holland, Amsterdam (1997) 503\u2013615."},{"key":"R50","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1111\/j.1475-3995.1998.tb00122.x","volume":"5","author":"Mausser","year":"1998","journal-title":"Int. Trans. Oper. Res."},{"key":"R51","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1057\/palgrave.jors.2600789","volume":"50","author":"Mausser","year":"1999","journal-title":"J. Oper. Res. Soc."},{"key":"R52","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0377-2217(98)00118-0","volume":"117","author":"Mausser","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R53","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1016\/j.ejor.2005.02.060","volume":"174","author":"Montemanni","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"R54","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.orl.2003.08.002","volume":"32","author":"Montemanni","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"R55","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"Montemanni","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"R56","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.ejor.2003.10.008","volume":"161","author":"Montemanni","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"R57","doi-asserted-by":"crossref","unstructured":"R. Montemanni and L.M. Gambardella, The robust shortest path problem with interval dataviaBenders decomposition,40R3(2005) 315\u2013328.","DOI":"10.1007\/s10288-005-0066-x"},{"key":"R58","unstructured":"R. Montemanni, J. Barta and L.M. Gambardella,Heuristic and preprocessing techniques for the robust traveling salesman problem with interval data. Technical Report IDSIA-01-06 (2006)."},{"key":"R59","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.1060.0181","volume":"41","author":"Montemanni","year":"2007","journal-title":"Transp. Sci."},{"key":"R60","unstructured":"Y. Nikulin,Robustness in combinatorial optimization and scheduling theory: An annotated bibliography. Christian-Albrechts University in Kiel, Working paper (2005)."},{"key":"R61","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10732-007-9057-8","volume":"14","author":"Nikulin","year":"2008","journal-title":"J. Heurist."},{"key":"R62","unstructured":"Y. Nikulin,Solving the robust shortest path problem with interval data using probabilistic metaheuristic approach.N597 CAU (2005) (with A. Drexl)."},{"key":"R63","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.cor.2010.11.009","volume":"38","author":"Pereira","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"R64","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.orl.2005.12.007","volume":"35","author":"Salazar-Neumann","year":"2007","journal-title":"Oper. Res. Lett."},{"key":"R65","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"Snyder","year":"2006","journal-title":"IIE Trans."},{"key":"R66","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"Yaman","year":"2001","journal-title":"Oper. Res. Lett."},{"key":"R67","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"Zieli\u0144ski","year":"2004","journal-title":"Eur. J. Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2011111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T05:53:52Z","timestamp":1560491632000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2011111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":67,"journal-issue":{"issue":"2"},"alternative-id":["ro110012"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2011111","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}