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 |
-
Multi-drone rescue search in a large network
Gonzalez, Victor, (2025)
-
Robust routing in deterministic delay-tolerant networks
Bocquillon, Ronan, (2018)
-
Designing a drone delivery network with automated battery swapping machines
Cokyasar, Taner, (2021)
- More ...
-
Planning and learning in average risk-aware MDPs
Wang, Weikai, (2025)
-
Fair resource allocation in weakly coupled Markov decision processes
Tu, Xiaohui, (2025)
-
Optimizing ultra-fast delivery networks and service guarantees under uncertainty
Wang, Xin, (2025)
- More ...