New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411)

From MaRDI portal
Revision as of 17:45, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
New facets and a branch-and-cut algorithm for the weighted clique problem.
scientific article

    Statements

    New facets and a branch-and-cut algorithm for the weighted clique problem. (English)
    0 references
    2 February 2004
    0 references
    Combinatorial optimization
    0 references
    Boolean quadratic problem
    0 references
    Edge-weighted clique
    0 references
    problem
    0 references
    Maximum dispersion problem
    0 references
    Polyhedra
    0 references

    Identifiers