On the hop-constrained survivable network design problem with reliable edges (Q342080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6654046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hop-constrained survivable network design problem with reliable edges |
scientific article; zbMATH DE number 6654046 |
Statements
On the hop-constrained survivable network design problem with reliable edges (English)
0 references
17 November 2016
0 references
network design
0 references
survivability
0 references
hop constraints
0 references
benders decomposition
0 references
branch-and-cut algorithms
0 references
0 references
0 references
0 references
0.8593851923942566
0 references
0.8593851923942566
0 references
0.8527446389198303
0 references
0.8427776098251343
0 references
0.8201342821121216
0 references
