A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897)
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: A cutting plane algorithm for computing k-edge survivability of a network |
scientific article; zbMATH DE number 2093025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane algorithm for computing \(k\)-edge survivability of a network |
scientific article; zbMATH DE number 2093025 |
Statements
A cutting plane algorithm for computing \(k\)-edge survivability of a network (English)
0 references
19 August 2004
0 references
Integer programming
0 references
Network survivability
0 references
Polyhedral
0 references
analysis
0 references
Cutting plane algorithm
0 references
0.7855696082115173
0 references
0.7719070911407471
0 references
