A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
Year of publication: |
2023
|
---|---|
Authors: | Carvalho, Iago A. ; Noronha, Thiago F. ; Duhamel, Christophe ; Vieira, Luiz F. M. ; Santos, Vinicius dos |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 30.2023, 2, p. 1120-1143
|
Subject: | interval uncertainty | metaheuristics | minmax regret | single-source shortest path | Theorie | Theory | Heuristik | Heuristics | Entscheidung unter Unsicherheit | Decision under uncertainty | Operations Research | Operations research | Risiko | Risk | Mathematische Optimierung | Mathematical programming |
-
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Ćwik, Michał, (2018)
-
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
Hughes, Martin, (2019)
-
Some robust inverse median problems on trees with interval costs
Le Xuan Dai, (2024)
- More ...
-
Carvalho, Iago A., (2021)
-
Monteiro, Cristiano Martins, (2024)
-
Integer programming formulations for the k-IN-A-TREE problem in graphs
Ferreira, Lucas Saldanha, (2024)
- More ...