Kizilates Evin, G.2020-12-012020-12-0120202367-45122367-4512https://doi.org/10.1007/978-3-030-36178-5_66https://hdl.handle.net/11454/61666The Maximum Clique Problem is widely studied optimization problem and plays an essential part in computer science. In the literature, therefore, there are many exact and heuristic approaches and new strategies are continuously being proposed. In this paper, the maximum clique problem is studied, and a new hybrid genetic algorithm is proposed for finding the maximum clique in a graph. The proposed algorithm is tested on the DIMACS and BHOSLIB benchmark instances. The computational results are compared with similar literature researches. The results prove the effectiveness of proposed algorithm. © 2020, Springer Nature Switzerland AG.en10.1007/978-3-030-36178-5_66info:eu-repo/semantics/closedAccessGraph theoryHeuristic algorithmsHybrid genetic algorithmsMaximum clique problemOptimization problemsBook Chapter437667742-s2.0-85083446756Q3