Minmax regret combinatorial optimization problems with investments
Year of publication: |
September 2017
|
---|---|
Authors: | Conde, Eduardo ; Leal, Marina |
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. 85.2017, p. 1-11
|
Subject: | Minmax regret models | Robustness and sensitivity analysis | Shortest path problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Entscheidung unter Unsicherheit | Decision under uncertainty | Sensitivitätsanalyse | Sensitivity analysis |
-
A minmax regret median problem on a tree under uncertain locations of the demand points
Conde, Eduardo, (2013)
-
Robustness of optimal portfolios under risk and stochastic dominance constraints
Dupačová, Jitka, (2014)
-
Minmax robustness for multi-objective optimization problems
Ehrgott, Matthias, (2014)
- More ...
-
A minmax regret version of the time-dependent shortest path problem
Conde, Eduardo, (2018)
-
A robust optimization model for distribution network design under a mixed integer set of scenarios
Conde, Eduardo, (2021)
-
On linear bilevel optimization problems with complementarity-constrained lower levels
Gabriel, Steven A., (2022)
- More ...