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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty |
-
Siddiqui, Sauleh, (2015)
-
Dynamic pricing to minimize maximum regret
Chen, Zhi-long, (2017)
-
Trade-off between robustness and cost for a storage loading problem : rule-based scenario generation
Büsing, Christina, (2018)
- More ...
-
An optimization model for the location of disaster refuges
Pérez-Galarce, Francisco, (2017)
-
Optimising the storage assignment and order-picking for the compact drive-in storage system
Revillot-Narváez, David, (2020)
-
On a class of interval data minimax regret CO problems
Candia-Véjar, Alfredo, (2008)
- More ...