Complexity of a classical flow restoration problem (Q2811305)
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: Complexity of a classical flow restoration problem |
scientific article; zbMATH DE number 6591787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of a classical flow restoration problem |
scientific article; zbMATH DE number 6591787 |
Statements
Complexity of a classical flow restoration problem (English)
0 references
10 June 2016
0 references
linear programming
0 references
equivalence of separation and optimization
0 references
multicommodity flow networks
0 references
path generation
0 references
survivable network design
0 references
\(\mathcal{NP}\)-hardness
0 references
0 references
0.86727244
0 references
0.8624909
0 references
0.8619287
0 references
0.86103815
0 references
0.8589201
0 references
