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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Scheduling-Verfahren | Scheduling problem |
-
Conde, Eduardo, (2019)
-
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
Chassein, André, (2018)
-
Drwal, Maciej, (2016)
- 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)
-
New models for the location of controversial facilities : a bilevel programming approach
Labbé, Martine, (2019)
- More ...