A probabilistic model for minmax regret in combinatorial optimization
Year of publication: |
2014
|
---|---|
Authors: | Natarajan, Karthik ; Shi, Dongjian ; Toh, Kim-chuan |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 62.2014, 1, p. 160-181
|
Subject: | minmax regret | probability | mixed-integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Ganzzahlige Optimierung | Integer programming | Wahrscheinlichkeitsrechnung | Probability theory |
-
Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
Drwal, Maciej, (2018)
-
Drwal, Maciej, (2020)
-
Radius of robust feasibility for mixed-integer problems
Liers, Frauke, (2022)
- More ...
-
Models for minimax stochastic linear optimization problems with risk aversion
Bertsimas, Dimitris, (2010)
-
Tractable robust expected utility and risk models for portfolio optimization
Natarajan, Karthik, (2010)
-
Beyond risk : ambiguity in supply chains
Natarajan, Karthik, (2012)
- More ...