Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837)

From MaRDI portal
Revision as of 16:31, 6 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58002887, #quickstatements; #temporary_batch_1707232231678)
scientific article
Language Label Description Also known as
English
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
scientific article

    Statements

    Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    cut polytope
    0 references
    unconstrained binary quadratic optimization
    0 references

    Identifiers