The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939)

From MaRDI portal
Revision as of 22:28, 22 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
scientific article

    Statements

    The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (English)
    0 references
    7 June 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    edge-weighted cliques
    0 references
    polyhedral combinatorics
    0 references
    integer programming
    0 references
    branch-and-cut
    0 references
    Boolean quadric polytope
    0 references