Semidefinite programming relaxations for the graph partitioning problem (Q1961466)

From MaRDI portal
Revision as of 16:36, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Semidefinite programming relaxations for the graph partitioning problem
scientific article

    Statements

    Semidefinite programming relaxations for the graph partitioning problem (English)
    0 references
    0 references
    0 references
    21 March 2000
    0 references
    graph partitioning
    0 references
    Lagrangian relaxations
    0 references
    semidefinite programming relaxations
    0 references
    gangster operator
    0 references

    Identifiers