The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A branch-and-cut algorithm for the k-edge connected subgraph problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(k\)-edge connected polyhedra on series-parallel graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4035361 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the linear relaxation of the 2-node connected subgraph polytope / rank | |||
Normal rank | |||
Latest revision as of 17:42, 12 July 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
