A practicable robust counterpart formulation for decomposable functions: a network congestion case study (Q4969341)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A practicable robust counterpart formulation for decomposable functions: a network congestion case study |
scientific article; zbMATH DE number 7255258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practicable robust counterpart formulation for decomposable functions: a network congestion case study |
scientific article; zbMATH DE number 7255258 |
Statements
A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study (English)
0 references
5 October 2020
0 references
robust optimization
0 references
nonlinear programming
0 references
queuing delay
0 references
network optimization
0 references
data-driven optimization
0 references
IP and packet network routing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7907208204269409
0 references
0.755466103553772
0 references
0.7551034688949585
0 references
0.7523804903030396
0 references
0.7484106421470642
0 references
