A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem (Q3057129)
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 branch-and-cut algorithm for the k-edge connected subgraph problem |
scientific article; zbMATH DE number 5818779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem |
scientific article; zbMATH DE number 5818779 |
Statements
A branch-and-cut algorithm for the k-edge connected subgraph problem (English)
0 references
24 November 2010
0 references
\(k\)-edge connected graph
0 references
polytope
0 references
facet
0 references
separation
0 references
reduction operations
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0.9192432165145874
0 references
0.8511388301849365
0 references
0.8478686809539795
0 references
0.8441482186317444
0 references
