Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems
Reference63 articles.
1. Afkhami, S., Ma, O.R., Soleimani, A.: A binary harmony search algorithm for solving the maximum clique problem. Int. J. Comput. Appl. 69(12), 38–43 (2013)
2. Andrade, D.V., Resende, M.G., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525–547 (2012)
3. Assad, A., Deep, K.: Applications of harmony search algorithm in data mining: a survey. In: Proceedings of Fifth International Conference on Soft Computing for Problem Solving, pp. 863–874. Springer, (2016)
4. Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865–890. Springer, Boston (2006)
5. Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133–142 (2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献