A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
Year of publication: |
2013
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Ljubić, Ivana ; Toth, Paolo |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 11.2013, 4, p. 349-360
|
Subject: | Robust combinatorial optimization problems | Bertsimas & Sim algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Robustes Verfahren | Robust statistics | Algorithmus | Algorithm |
-
Xi, Xiang, (2020)
-
Ermis, Gülcin, (2019)
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
- More ...
-
Exact approaches for solving robust prize-collecting Steiner tree problems
Álvarez-Miranda, Eduardo, (2013)
-
The recoverable robust two-level network design problem
Álvarez-Miranda, Eduardo, (2015)
-
Exact approaches for solving robust prize-collecting Steiner tree problems
Álvarez-Miranda, Eduardo, (2013)
- More ...