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

From MaRDI portal
Revision as of 08:00, 6 July 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
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