A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324)

From MaRDI portal
Revision as of 23:16, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for solving max-\(k\)-cut problem
scientific article

    Statements

    A branch-and-bound algorithm for solving max-\(k\)-cut problem (English)
    0 references
    0 references
    0 references
    29 September 2021
    0 references
    max-\(k\)-cut
    0 references
    semidefinite relaxation
    0 references
    branch-and-bound algorithm
    0 references

    Identifiers