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

From MaRDI portal
Revision as of 13:49, 15 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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