Article references

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:

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan

RAIRO-Oper. Res., 45 2 (2011) 101-129

Published online: 2011-08-24

DOI: https://doi.org/10.1051/ro/2011111

This article has been cited by the following article(s):

A note on robust Nash equilibria with uncertainties

Vianney Perchet
RAIRO - Operations Research 48 (3) 365 (2014)
DOI: 10.1051/ro/2014001
See this article

Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems

Amir Ardestani-Jaafari and Erick Delage
Operations Research 64 (2) 474 (2016)
DOI: 10.1287/opre.2016.1483
See this article

System Redundancy Optimization with Uncertain Stress-based Component Reliability: Minimization of Regret

Nida Chatwattanasiri, David W. Coit and Naruemon Wattanapongsakorn
Reliability Engineering & System Safety (2016)
DOI: 10.1016/j.ress.2016.05.011
See this article

Maximum excess dominance: Identifying impractical solutions in linear problems with interval coefficients

Chunling Luo, Chin Hon Tan and Xiao Liu
European Journal of Operational Research 282 (2) 660 (2020)
DOI: 10.1016/j.ejor.2019.09.030
See this article

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 Santos
Journal of Global Optimization 60 (2) 265 (2014)
DOI: 10.1007/s10898-014-0187-x
See this article

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

Fabio Furini, Manuel Iori, Silvano Martello and Mutsunori Yagiura
INFORMS Journal on Computing 27 (2) 392 (2015)
DOI: 10.1287/ijoc.2014.0632
See this article

The minmax regret robust shortest path problem in a finite multi-scenario model

Marta M.B. Pascoal and Marisa Resende
Applied Mathematics and Computation 241 88 (2014)
DOI: 10.1016/j.amc.2014.04.076
See this article

Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios

Elyn Solano-Charris, Christian Prins and Andréa Cynthia Santos
Applied Soft Computing 32 518 (2015)
DOI: 10.1016/j.asoc.2015.03.058
See this article

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. Vieira
IFAC-PapersOnLine 49 (12) 443 (2016)
DOI: 10.1016/j.ifacol.2016.07.649
See this article

On exact solutions for the Minmax Regret Spanning Tree problem

Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar and Paolo Toth
Computers & Operations Research 47 114 (2014)
DOI: 10.1016/j.cor.2014.02.007
See this article

Algorithms for the Minmax Regret Path problem with interval data

Francisco Pérez-Galarce, Alfredo Candia-Véjar, César Astudillo and Matthew Bardeen
Information Sciences 462 218 (2018)
DOI: 10.1016/j.ins.2018.06.016
See this article

Extensions of labeling algorithms for multi-objective uncertain shortest path problems

Andrea Raith, Marie Schmidt, Anita Schöbel and Lisa Thom
Networks 72 (1) 84 (2018)
DOI: 10.1002/net.21815
See this article

Distance learning techniques for ontology similarity measuring and ontology mapping

Wei Gao, Mohammad Reza Farahani, Adnan Aslam and Sunilkumar Hosamani
Cluster Computing 20 (2) 959 (2017)
DOI: 10.1007/s10586-017-0887-3
See this article

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem

Wei Wu, Manuel Iori, Silvano Martello and Mutsunori Yagiura
Computers & Industrial Engineering 125 98 (2018)
DOI: 10.1016/j.cie.2018.08.007
See this article

Min max min robust (relative) regret combinatorial optimization

Alejandro Crema
Mathematical Methods of Operations Research 92 (2) 249 (2020)
DOI: 10.1007/s00186-020-00712-y
See this article

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities

Guru Prakash Arumugam, John Augustine, Mordecai J. Golin and Prashanth Srikanthan
Algorithmica 81 (9) 3534 (2019)
DOI: 10.1007/s00453-019-00589-2
See this article