The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1070247 |
||
| Property / author | |||
| Property / author: Ali Ridha Mahjoub / rank | |||
Revision as of 06:42, 22 February 2024
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
