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 wreiddiol | Saesneg |
---|---|
Rhif yr erthygl | IJMHEUR-200780 |
Tudalennau (o-i) | 152-174 |
Nifer y tudalennau | 23 |
Cyfnodolyn | International Journal of Metaheuristics |
Cyfrol | 7 |
Rhif cyhoeddi | 2 |
Dynodwyr Gwrthrych Digidol (DOIs) | |
Statws | Cyhoeddwyd - 1 Maw 2019 |