Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559)
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: Branch-and-cut methods for the network design problem with vulnerability constraints |
scientific article; zbMATH DE number 6901558
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut methods for the network design problem with vulnerability constraints |
scientific article; zbMATH DE number 6901558 |
Statements
Branch-and-cut methods for the network design problem with vulnerability constraints (English)
0 references
11 July 2018
0 references
networks
0 references
integer programming
0 references
survivable network design
0 references
hop-constraints
0 references
OR in telecommunications
0 references
Benders decomposition
0 references
0 references
0 references
0 references
0.9196405
0 references
0.89600915
0 references
0.89463365
0 references
0.8899648
0 references
0.88433236
0 references
0 references
0.87885547
0 references
0.87880886
0 references
0.87780774
0 references
0.8714481
0 references
