The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut |
scientific article |
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
