Robust combinatorial optimization with variable budgeted uncertainty
Year of publication: |
2013
|
---|---|
Authors: | Poss, Michael |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 11.2013, 1, p. 75-92
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Risiko | Risk | Scheduling-Verfahren | Scheduling problem |
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
-
Pirogov, Aleksandr, (2021)
-
On recoverable and two-stage robust selection problems with budgeted uncertainty
Chassein, André, (2018)
- More ...
-
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Pessoa, Artur, (2021)
-
Robust inventory theory with perishable products
Santos, Marcio Costa, (2020)
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
- More ...