Solving the maximum clique problem with a hybrid algorithm

Derek Smith, Stephanie Perkins, Roberto Montemanni

    Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

    60 Wedi eu Llwytho i Lawr (Pure)

    Crynodeb

    A hybrid algorithm for the maximum clique problem is presented. A heuristic is used to generate cliques and these are improved by some simple optimizations and tabu search. All components of the algorithm make use of an exact algorithm or a pseudoexact algorithm, which is an exact algorithm with some specialized pruning. Preprocessing is useful for some instances. The algorithm is shown to be successful using standard and new benchmarks.
    Iaith wreiddiolSaesneg
    Rhif yr erthyglIJMHEUR-200780
    Tudalennau (o-i)152-174
    Nifer y tudalennau23
    CyfnodolynInternational Journal of Metaheuristics
    Cyfrol7
    Rhif cyhoeddi2
    Dynodwyr Gwrthrych Digidol (DOIs)
    StatwsCyhoeddwyd - 1 Maw 2019

    Ôl bys

    Gweld gwybodaeth am bynciau ymchwil 'Solving the maximum clique problem with a hybrid algorithm'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

    Dyfynnu hyn