A New Genetic Algorithm for the Maximum Clique Problem
Küçük Resim Yok
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The 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.
Açıklama
Anahtar Kelimeler
Graph theory, Heuristic algorithms, Hybrid genetic algorithms, Maximum clique problem, Optimization problems
Kaynak
Lecture Notes on Data Engineering and Communications Technologies
WoS Q Değeri
Scopus Q Değeri
Q3
Cilt
43
