Surveying Some Metaheuristic Algorithms For Solving Maximum Clique Graph Problem

Tóm tắt

Maximum clique graph problem is a combinato-rial optimization that applies science and engineering such as social networks, telecommunication networks, bioinformatics, etc. Maximum clique is a problem of class NP-hard. There are many approaches for solving the maximum clique graph problem such as algorithms to find the exact solutions, heuristic algorithms, metaheuristic algorithms, etc. In this paper, we survey the approach for solving the maximum clique graph problem in the direction of metaheuristic algorithms and evaluate the quality of these research based on the experimental data system DIMACS. This survey can be useful for further research on maximum clique graph problems.