Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836)

From MaRDI portal
Revision as of 07:42, 12 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
Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
scientific article

    Statements

    Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (English)
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    nonconvex quadratically constrained quadratic programming
    0 references
    semidefinite program relaxation
    0 references
    approximation bound
    0 references
    NP-hard
    0 references

    Identifiers

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