Solving the Maximum Clique Problem with a Hybrid Algorithm

Derek H. Smith,Stephanie Perkins,Roberto Montemanni

International Journal of Metaheuristics (IJMHeur)（2019）

Division of Mathematics and Statistics

被引用7|浏览31

摘要

A hybrid algorithm for the maximum clique problem is presented. A heuristic is used to generate cliques and these are improved by some simple optimisations 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 specialised pruning. Pre-processing is useful for some instances. The algorithm is shown to be successful using standard and new benchmarks.

更多

查看译文

关键词

combinatorial optimisation,maximum clique,hybrid algorithm,Tabu search,pseudoexact algorithm,pre-processing,benchmarks