A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964)

From MaRDI portal
Revision as of 09:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
scientific article

    Statements

    A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    19 August 1996
    0 references
    minmax eigenvalue problems
    0 references
    theta function
    0 references
    quadratic assignment
    0 references
    graph partitioning
    0 references
    max-clique problem
    0 references
    relaxations of \((0,1)\)-quadratic programming problems
    0 references
    semidefinite programs
    0 references
    parametric trust region problems
    0 references
    concave quadratic maximization
    0 references
    Lagrangian duality
    0 references

    Identifiers