On exact solutions for the Minimax Regret Spanning Tree problem
Year of publication: |
2014
|
---|---|
Authors: | Pérez-Galarce, Francisco ; Álvarez-Miranda, Eduardo ; Candia-Véjar, Alfredo ; Toth, Paolo |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 47.2014, p. 114-122
|
Subject: | Minimum Spanning Tree | Minimax regret | Robust optimization | Interval uncertainty | Branch-and-cut | Benders decomposition | Entscheidung unter Unsicherheit | Decision under uncertainty | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Dekompositionsverfahren | Decomposition method | Spieltheorie | Game theory | Robustes Verfahren | Robust statistics |
-
Siddiqui, Sauleh, (2015)
-
The robust (minmax regret) quadratic assignment problem with interval flows
Feizollahi, Mohammad Javad, (2014)
-
Fabio, Furini, (2022)
- More ...
-
Exact approaches for solving robust prize-collecting Steiner tree problems
Álvarez-Miranda, Eduardo, (2013)
-
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
Álvarez-Miranda, Eduardo, (2013)
-
The recoverable robust two-level network design problem
Álvarez-Miranda, Eduardo, (2015)
- More ...