Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183)
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: Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem |
scientific article; zbMATH DE number 7595910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem |
scientific article; zbMATH DE number 7595910 |
Statements
Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (English)
0 references
4 October 2022
0 references
\(k\)-terminal cut
0 references
optimization
0 references
branch-and-bound
0 references
minimum isolating cut
0 references
clustering
0 references
0.99771327
0 references
0.88367397
0 references
0.88213575
0 references
0.8809235
0 references
0.8733254
0 references
0.87197304
0 references
0 references
0.8628602
0 references
0.86145186
0 references
