An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796)

From MaRDI portal
Revision as of 07:35, 24 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
scientific article

    Statements

    title
    An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (English)
    0 references
    author
    Zhuqi Miao
    0 references
    publication date
    7 January 2021
    0 references
    zbMATH Keywords
    quasi-clique
    0 references
    clique relaxations
    0 references
    graph-based data mining
    0 references
    Lagrangian duality
    0 references
    describes a project that uses
    MKL
    0 references
    Gurobi
    0 references
    SparseMatrix
    0 references
    DIMACS
    0 references
    cites work
    Q4945528
    0 references
    Q3044359
    0 references
    Nonlinear Programming
    0 references
    Q3145799
    0 references
    Q4821526
    0 references
    Q4198056
    0 references
    Q5689624
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    90C27
    0 references
    90C35
    0 references
    zbMATH DE Number
    7290874
    0 references
    OpenAlex ID
    W3004725848
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3386796&oldid=36642873"
    Powered by MediaWiki