Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.09.025 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134200749 / rank | |||
Revision as of 02:25, 20 March 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
