An exact algorithm for large-scale continuous nonlinear resource allocation problems with minimax regret objectives
Year of publication: |
2021
|
---|---|
Authors: | Park, Jungho ; El-Amine, Hadi ; Mutlu, Nevin |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1213-1228
|
Subject: | robust optimization | interval minimax regret | continuous nonlinear optimization | Benders-type decomposition | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Algorithmus | Algorithm | Nichtlineare Optimierung | Nonlinear programming | Allokation | Allocation | Robustes Verfahren | Robust statistics |
-
Data-driven optimization with distributionally robust secondorder stochastic dominance constraints
Peng, Chun, (2021)
-
Hanks, Robert W., (2017)
-
Robust balancing of straight assembly lines with inerval task times
Gurevsky, E., (2013)
- More ...
-
Offering memories to sell goods? : pricing and welfare implications of experiential retail
Mutlu, Nevin, (2023)
-
Solving a production-routing problem with price-dependent demand using an outer approximation method
Torkaman, Somayeh, (2020)
-
Torkaman, Somayeh, (2022)
- More ...