@ARTICLE{Schiff_Krzysztof_Ant_2024,
 author={Schiff, Krzysztof},
 volume={vol. 70},
 number={No 2},
 journal={International Journal of Electronics and Telecommunications},
 pages={381-387},
 howpublished={online},
 year={2024},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={This article deals with the problem of finding the maximum number of maximum cliques in a weighted graph with all edges between vertices from different d-division of a graph with the minimum total weight of all these cliques, and the problem of finding the maximum number of maximum cliques in a nonweighted graph with not all edges between vertices from different d-division of the graph. This article presents new ant algorithms with new desire functions for these problems. These algorithms were tested for their purpose with different changing input parameters, the test results were tabulated and discussed, the best algorithms were indicated.},
 type={Article},
 title={Ant algorithms for finding weighted and unweighted maximum cliques in d-division graphs},
 URL={http://journals.pan.pl/Content/131797/16-4530-Schiff-sk.pdf},
 doi={10.24425/ijet.2024.149556},
 keywords={d-division graph, ant algorithm, maximum clique, machine control, object tracking},
}