Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116)

From MaRDI portal
Revision as of 10:53, 22 June 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
Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
scientific article

    Statements

    Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (English)
    0 references
    0 references
    0 references
    27 January 2015
    0 references

    Identifiers