Minmax regret combinatorial optimization problems: an Algorithmic Perspective
RAIRO-Oper. Res., 45 2 (2011) 101-129
Published online: 2011-08-24
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
New Heuristic Approaches for the Min–Max Regret Traveling Salesman Problem
Kazuki Hasegawa, Wei Wu and Mutsunori YagiuraIEEE Access 13 63952 (2025)
https://doi.org/10.1109/ACCESS.2025.3558359
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli and Silvano MartelloComputers & Operations Research 143 105692 (2022)
https://doi.org/10.1016/j.cor.2021.105692
Improved robust shortest paths by penalized investments
Francisco Pérez-Galarce, Alfredo Candia-Véjar, Guido Maculan and Nelson MaculanRAIRO - Operations Research 55 (3) 1865 (2021)
https://doi.org/10.1051/ro/2021086
Maximum excess dominance: Identifying impractical solutions in linear problems with interval coefficients
Chunling Luo, Chin Hon Tan and Xiao LiuEuropean Journal of Operational Research 282 (2) 660 (2020)
https://doi.org/10.1016/j.ejor.2019.09.030
Min max min robust (relative) regret combinatorial optimization
Alejandro CremaMathematical Methods of Operations Research 92 (2) 249 (2020)
https://doi.org/10.1007/s00186-020-00712-y
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin and Prashanth SrikanthanAlgorithmica 81 (9) 3534 (2019)
https://doi.org/10.1007/s00453-019-00589-2
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
Wei Wu, Manuel Iori, Silvano Martello and Mutsunori YagiuraComputers & Industrial Engineering 125 98 (2018)
https://doi.org/10.1016/j.cie.2018.08.007
Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
Andrea Raith, Marie Schmidt, Anita Schöbel and Lisa ThomNetworks 72 (1) 84 (2018)
https://doi.org/10.1002/net.21815
Algorithms for the Minmax Regret Path problem with interval data
Francisco Pérez-Galarce, Alfredo Candia-Véjar, César Astudillo and Matthew BardeenInformation Sciences 462 218 (2018)
https://doi.org/10.1016/j.ins.2018.06.016
Distance learning techniques for ontology similarity measuring and ontology mapping
Wei Gao, Mohammad Reza Farahani, Adnan Aslam and Sunilkumar HosamaniCluster Computing 20 (2) 959 (2017)
https://doi.org/10.1007/s10586-017-0887-3
System Redundancy Optimization with Uncertain Stress-based Component Reliability: Minimization of Regret
Nida Chatwattanasiri, David W. Coit and Naruemon WattanapongsakornReliability Engineering & System Safety (2016)
https://doi.org/10.1016/j.ress.2016.05.011
Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
Amir Ardestani-Jaafari and Erick DelageOperations Research 64 (2) 474 (2016)
https://doi.org/10.1287/opre.2016.1483
A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel and Luiz F.M. VieiraIFAC-PapersOnLine 49 (12) 443 (2016)
https://doi.org/10.1016/j.ifacol.2016.07.649
726 (2016)
https://doi.org/10.1109/IEEM.2016.7797971
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
Fabio Furini, Manuel Iori, Silvano Martello and Mutsunori YagiuraINFORMS Journal on Computing 27 (2) 392 (2015)
https://doi.org/10.1287/ijoc.2014.0632
Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios
Elyn Solano-Charris, Christian Prins and Andréa Cynthia SantosApplied Soft Computing 32 518 (2015)
https://doi.org/10.1016/j.asoc.2015.03.058
A note on robust Nash equilibria with uncertainties
Vianney PerchetRAIRO - Operations Research 48 (3) 365 (2014)
https://doi.org/10.1051/ro/2014001
On exact solutions for the Minmax Regret Spanning Tree problem
Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar and Paolo TothComputers & Operations Research 47 114 (2014)
https://doi.org/10.1016/j.cor.2014.02.007
The minmax regret robust shortest path problem in a finite multi-scenario model
Marta M.B. Pascoal and Marisa ResendeApplied Mathematics and Computation 241 88 (2014)
https://doi.org/10.1016/j.amc.2014.04.076
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Amadeu Almeida Coco, João Carlos Abreu Júnior, Thiago F. Noronha and Andréa Cynthia SantosJournal of Global Optimization 60 (2) 265 (2014)
https://doi.org/10.1007/s10898-014-0187-x