TY - JOUR
TI - An improvement of the ant algorithm for the maximum clique problem
AU - Schiff, Krzysztof
TI - An improvement of the ant algorithm for the maximum clique problem
AB - 
	The maximum clique problem is a very well-known NP-complete problem and for such a problem, meta-heuristic algorithms have been developed which ant algorithms belongs to. There are many algorithms including ant algorithms that have been elaborated for this problem. In this paper, a new dynamic function of selecting with a new improvement procedure in order to get a larger size of clique for the ant algorithm is presented and this search for the maximum clique in graph is compared to the bestn ant algorithms that are already known.
VL - 2015
IS - Electronical Engineering Issue 2-E (13) 2015
PY - 2016
SN - 0011-4561
C1 - 2353-737X
SP - 225
EP - 233
DO - 10.4467/2353737XCT.15.098.3930
UR - https://ejournals.eu/en/journal/czasopismo-techniczne/article/an-improvement-of-the-ant-algorithm-for-the-maximum-clique-problem
KW - maximum clique
KW - ant algorithm
KW - desirability function