ALGORITHMIC APPROACHES FOR MAXIMUM CLIQUE PROBLEM
Project no. 645 · Status: Kapanmış · 2015
Summary
The Maximum Clique Problem is much studied graph theory optimization problem in operation research field, and it belongs to the class of NP-Complete. The problem has widespread field of application in many areas. Besides, the problem is closely related to many graph theory problems. Thus, the maximum clique problem plays an important role in computer science field. In this project, the maximum clique problem is studied, the solution approaches for the problem in literature are investigated and a new hybrid genetic algorithm have been proposed for the problem. The proposed algorithm has been implemented in Java and has been tested on the DIMACS and BHOSLIB benchmark instances, the results have been compared with similar studies the literature works. The experimental results show that proposed algorithm is effective.