Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard |
scientific article |
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
