The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409)
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: The k-node connected subgraph problem: polyhedral analysis and branch-and-cut |
scientific article; zbMATH DE number 6640264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut |
scientific article; zbMATH DE number 6640264 |
Statements
The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (English)
0 references
18 October 2016
0 references
\(k\)-node connected graph
0 references
polytope
0 references
separation
0 references
branch-and-cut algorithm
0 references
0.9192432165145874
0 references
0.8492357730865479
0 references
0.8373190760612488
0 references
0.8210216760635376
0 references
