Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809)

From MaRDI portal
Revision as of 17:56, 8 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
Speeding up branch and bound algorithms for solving the maximum clique problem
scientific article

    Statements

    title
    Speeding up branch and bound algorithms for solving the maximum clique problem (English)
    0 references
    author
    Evgeny Maslov
    0 references
    Mikhail Batsyn
    0 references
    Panos M. Pardalos
    0 references
    publication date
    3 July 2014
    0 references
    zbMATH Keywords
    maximum clique problem
    0 references
    branch and bound algorithm
    0 references
    heuristic solution
    0 references
    graph colouring
    0 references
    describes a project that uses
    MaxCliqueDyn
    0 references
    Tabu search
    0 references
    Algorithm 457
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C85
    0 references
    05C15
    0 references
    90C27
    0 references
    90C59
    0 references
    90-08
    0 references
    zbMATH DE Number
    6312836
    0 references
    OpenAlex ID
    W2013020979
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2249809&oldid=35397462"
    Powered by MediaWiki