Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793)

From MaRDI portal
Revision as of 18:02, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
scientific article

    Statements

    Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 December 2018
    0 references
    combinatorial quadratic optimization problems
    0 references
    binary and complementarity condition
    0 references
    completely positive relaxations
    0 references
    doubly nonnegative relaxations
    0 references
    semidefinite relaxations
    0 references
    equivalence of feasible regions
    0 references
    nondegeneracy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references