A branch-and-cut algorithm for two-level survivable network design problems (Q342262)
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 6654124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for two-level survivable network design problems |
scientific article; zbMATH DE number 6654124 |
Statements
A branch-and-cut algorithm for two-level survivable network design problems (English)
0 references
17 November 2016
0 references
network design
0 references
survivability
0 references
hierarchical networks
0 references
valid inequalities
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0.938450038433075
0 references
0.8360722064971924
0 references
0.8331781625747681
0 references
