A practicable robust counterpart formulation for decomposable functions : a network congestion case study
Year of publication: |
March-April 2018
|
---|---|
Authors: | Delage, Erick ; Gianoli, Luca G. ; Sansò, Brunilde |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 66.2018, 2, p. 535-567
|
Subject: | robust optimization | nonlinear programming | queuing delay | network optimization | data-driven optimization | IP and packet network routing | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Tourenplanung | Vehicle routing problem | Nichtlineare Optimierung | Nonlinear programming | Warteschlangentheorie | Queueing theory | Netzwerk | Network | Engpass | Bottleneck | Unternehmensnetzwerk | Business network |
-
Robust routing in deterministic delay-tolerant networks
Bocquillon, Ronan, (2018)
-
Designing a drone delivery network with automated battery swapping machines
Cokyasar, Taner, (2021)
-
Procurement strategy with credit risk
Wang, Hsiao-fan, (2013)
- More ...
-
A double-oracle, logic-based Benders decomposition approach to solve the K-adaptability problem
Ghahtarani, Alireza, (2023)
-
The value of stochastic modeling in two-stage stochastic programs with cost uncertainty
Delage, Erick, (2014)
-
Decision making under uncertainty when preference information is incomplete
Armbruster, Benjamin, (2015)
- More ...