Annealed replication: A new heuristic for the maximum clique problem (Q1613385): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00233-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119025565 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Annealed replication: A new heuristic for the maximum clique problem
scientific article

    Statements

    Annealed replication: A new heuristic for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    quadratic optimization
    0 references
    dynamical systems
    0 references
    replicator dynamics
    0 references
    stable set
    0 references
    independent set
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers