A robust optimization model for distribution network design under a mixed integer set of scenarios
Year of publication: |
2021
|
---|---|
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. 136.2021, p. 1-14
|
Subject: | Minmax regret models and Benders decomposition algorithms | Robust network design | Theorie | Theory | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Robustes Verfahren | Robust statistics | Lieferkette | Supply chain | Algorithmus | Algorithm |
-
Decomposition approaches for recoverable robust optimization problems
Akker, J. M. van den, (2016)
-
Samouei, Parvaneh, (2023)
-
Bektaş, Tolga, (2012)
- More ...
-
A minmax regret version of the time-dependent shortest path problem
Conde, Eduardo, (2018)
-
Minmax regret combinatorial optimization problems with investments
Conde, Eduardo, (2017)
-
Global optimization for bilevel portfolio design : economic insights from the Dow Jones Index
González-Díaz, Julio, (2021)
- More ...