Parallel Hybrid Genetic Algorithm for Maximum Clique Problem on OpenCL-Reference-Cited by-同舟云学术

Parallel Hybrid Genetic Algorithm for Maximum Clique Problem on OpenCL

Published:2015 Issue: Volume: Page:653-663
ISSN:1865-0929
Container-title:Communications in Computer and Information Science
language:
Short-container-title:

Author:

Li Li,Zhang Kai,Yang Siman,He Juanjuan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-49014-3_58

Reference18 articles.

1. Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1–74. Kluwer Academic Publishers, Dordrecht (1999)

2. Wang, X., Miao, Y.: GAEM: a hybrid algorithm incorporating GA with EM for planted edited motif finding problem. Curr. Bioinform. 9(5), 463–469 (2014)

3. Ostergard, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. Sixth Twente Workshop Graphs Comb. Optim. 3, 197–207 (2002)

4. Song, T., Pan, L.: Spiking neural P systems with rules on synapses working in maximum spiking strategy. IEEE Trans. NanoBiosci. 14(4), 465–477 (2015)

5. Song, T., Pan, L., Jiang, K., et al.: Normal forms for some classes of sequential spiking neural P systems. IEEE Trans. NanoBiosci. 12(3), 255–264 (2013)

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

1. Classical Thermodynamics-based Parallel Annealing Algorithm for High-speed and Robust Combinatorial Optimization;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

2. Applying K-means Clustering and Genetic Algorithm for Solving MTSP;Bio-inspired Computing – Theories and Applications;2016