Author:
Hasan Mahmudul,Islam Md. Rafiqul,Mugdha Amrita Ghosh
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems
Reference45 articles.
1. Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company, New York (1979)
2. Solnon, C., Fenet, S.: A study of ACO capabilities for solving the maximum clique problem. J. Heurist. 12(3), 155–180 (2006)
3. Marchiori, E.: A simple heuristic based genetic algorithm for the maximum clique problem. In: Symposium on Applied Computing: Proceedings of the 1998 ACM Symposium on Applied Computing. vol. 27, pp. 366–373 (1998)
4. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. Local Search Comb. Optim. 1(1), 215–310 (1997)
5. Xu, X., Ma, J., Lei, J.: An improved ant colony optimization for the maximum clique problem. In: Third International Conference on Natural Computation (ICNC 2007), vol. 4, pp. 766–770 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献