A hybrid heuristic for the maximum clique problem (Q2491328)

From MaRDI portal
Revision as of 16:11, 24 June 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
A hybrid heuristic for the maximum clique problem
scientific article

    Statements

    title
    A hybrid heuristic for the maximum clique problem (English)
    0 references
    author
    Alok Singh
    0 references
    Ashok Kumar Gupta
    0 references
    publication date
    29 May 2006
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    05C85
    0 references
    90C59
    0 references
    zbMATH DE Number
    5028025
    0 references
    zbMATH Keywords
    Combinatorial optimization
    0 references
    Greedy heuristic
    0 references
    Maximum clique
    0 references
    Steady-state genetic algorithm
    0 references
    describes a project that uses
    Algorithm 787
    0 references
    DIMACS
    0 references
    QUALEX
    0 references
    OpenAlex ID
    W1976659547
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2491328&oldid=34876702"
    Powered by MediaWiki