Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating \(k\)-cuts using network strength as a Lagrangean relaxation |
scientific article |
Statements
Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (English)
0 references
23 November 2007
0 references
graph theory
0 references
Lagrangean relaxation
0 references
