Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:24, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut methods for the network design problem with vulnerability constraints |
scientific article |
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
