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 | Theorie | Theory | Robustes Verfahren | Robust statistics | Netzwerk | Network | Unternehmensnetzwerk | Business network | Engpass | Bottleneck | Nichtlineare Optimierung | Nonlinear programming | Tourenplanung | Vehicle routing problem |
-
An adaptive memory programming framework for the robust capacitated vehicle routing problem
Gounaris, Chrysanthos E., (2016)
-
Robust routing in deterministic delay-tolerant networks
Bocquillon, Ronan, (2018)
-
Procurement strategy with credit risk
Wang, Hsiao-fan, (2013)
- More ...
-
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds
Costa, Leandro R., (2021)
-
Boiardi, Silvia, (2016)
-
Evolution of high throughput satellite systems : vision, requirements, and key technologies
Ben Yahia, Olfa, (2023)
- More ...