Min max min robust (relative) regret combinatorial optimization
Year of publication: |
2020
|
---|---|
Authors: | Crema, Alejandro |
Published in: |
Mathematical methods of operations research : ZOR. - Berlin : Springer, ISSN 1432-5217, ZDB-ID 1459420-1. - Vol. 92.2020, 2, p. 249-283
|
Subject: | Minmax regret | Robust programming | Greedy algorithms | Multiparametric programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Robustes Verfahren | Robust statistics |
-
The robust (minmax regret) assembly line worker assignment and balancing problem
Pereira, Jordi, (2018)
-
A double oracle approach to minmax regret optimization problems with interval data
Gilbert, Hugo, (2017)
-
A note on robustness in multidisciplinary decision making issues under uncertainties
Ichchou, Mohamed, (2010)
- More ...
-
Generalized average shadow prices and bottlenecks
Crema, Alejandro, (2018)
-
The multiparametric 0-1-integer linear programming problem: A unified approach
Crema, Alejandro, (2002)
-
Crema, Alejandro, (2000)
- More ...