Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181)
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: Robust network optimization under polyhedral demand uncertainty is NP-hard |
scientific article; zbMATH DE number 5703763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard |
scientific article; zbMATH DE number 5703763 |
Statements
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (English)
0 references
5 May 2010
0 references
robust optimization
0 references
network optimization
0 references
network flows
0 references
polyhedral uncertainty
0 references
multicommodity flows
0 references
0 references
0.8323361277580261
0 references
0.7990996837615967
0 references
0.7962723970413208
0 references
0.7938336730003357
0 references
0.792041003704071
0 references
