@article{e6ffd267-62c8-46e1-bd18-8b1bc727e546,
author = {Krzysztof  Schiff},
title = {An improvement of the ant algorithm for the maximum clique problem},
journal = {Technical Transactions},
volume = {2015},
number = {Electronical Engineering Issue 2-E (13) 2015},
year = {2016},
issn = {0011-4561},
pages = {225-233},keywords = {maximum clique; ant algorithm; desirability function},
abstract = {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.},
doi = {10.4467/2353737XCT.15.098.3930},
url = {https://ejournals.eu/en/journal/czasopismo-techniczne/article/an-improvement-of-the-ant-algorithm-for-the-maximum-clique-problem}
}