%0 Journal Article
%T An improvement of the ant algorithm for the maximum clique problem
%A Schiff, Krzysztof
%J Czasopismo Techniczne
%V 2015
%R 10.4467/2353737XCT.15.098.3930
%N Elektrotechnika Zeszyt 2-E (13) 2015
%P 225-233
%K maximum clique, ant algorithm, desirability function
%@ 0011-4561
%D 2016
%U https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/an-improvement-of-the-ant-algorithm-for-the-maximum-clique-problem
%X 
	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.