Partitioning of an M-Part Weighted Graph with N Vertices in Each Part into N Cliques with M Vertices and the Total Minimum Sum of Their Edges Weights Using Ant Algorithms-Reference-Cited by-同舟云学术

Partitioning of an M-Part Weighted Graph with N Vertices in Each Part into N Cliques with M Vertices and the Total Minimum Sum of Their Edges Weights Using Ant Algorithms

Published:2023 Issue: Volume: Page:265-272
ISSN:2367-3370
Container-title:Lecture Notes in Networks and Systems
language:
Short-container-title:

Author:

Schiff Krzysztof^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-37720-4_24

Reference24 articles.

1. Dehgan, A., Assari, S.M., Shah, M.: GMMCP Tracker: Globally optimal generalized maximum multi clique problem for multiple object tracking. Conf. Comput. Vis. Pattern Recognit. 1, 4091–4099 (2015)

2. Deb, S., Yeddanapudi, M., PattiPati, K., Bar-Shalom, T.: A generalized S-D assignment algorithm for multi-sensor-multi-target state estimation. IEEE Trans. Aerosp. Electron. Syst. 33, 523–538 (1999)

3. Feremans, C., Labbe, M., Laportee, G.: Generalized network design problem. Eur. J. Oper. Res. 148, 1–13 (2003)

4. Koster, A.M.C.A., Hoesel, S.P.M., Kolen, A.W.J.: The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. 23, 89–97 (1998)

5. Bozdogan, A.O., Yilmaz, A.E., Efe, M.: Performance Analysis of swarm optimization approaches for the generalized assignment problem in multi-target tracking applications. Turkish J. Elec. Eng. Comp. Sci 18, 1059–1076 (2010)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ant algorithms for finding weighted and unweighted maximum cliques in d-division graphs;International Journal of Electronics and Telecommunications;2024-06-25