A simple simulated annealing algorithm for the maximum clique problem (Q2456476)

From MaRDI portal
Revision as of 20:38, 4 August 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
A simple simulated annealing algorithm for the maximum clique problem
scientific article

    Statements

    A simple simulated annealing algorithm for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2007
    0 references
    Simulated annealing algorithm
    0 references
    maximum clique problem
    0 references
    minimum vertex cover problem
    0 references
    NP-hard optimization problem
    0 references
    heuristic algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references