An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651)

From MaRDI portal
Revision as of 10:03, 28 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An adaptive multistart tabu search approach to solve the maximum clique problem
scientific article

    Statements

    An adaptive multistart tabu search approach to solve the maximum clique problem (English)
    0 references
    0 references
    0 references
    9 August 2013
    0 references
    tabu search
    0 references
    maximum clique
    0 references
    constrained neighborhood
    0 references
    informed restart
    0 references
    combinatorial optimization
    0 references

    Identifiers