Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907)

From MaRDI portal
Revision as of 07:48, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semidefinite programming approach for the quadratic assignment problem with a sparse graph
scientific article

    Statements

    Semidefinite programming approach for the quadratic assignment problem with a sparse graph (English)
    0 references
    0 references
    0 references
    20 April 2018
    0 references
    graph matching
    0 references
    quadratic assignment problem
    0 references
    convex relaxation
    0 references
    semidefinite programming
    0 references
    alternating direction method of multipliers
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers