A branch-and-cut algorithm for two-level survivable network design problems (Q342262): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:39, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for two-level survivable network design problems |
scientific article |
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
