Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Aggarwal, C. C., Orlin, J. B., and Tai, R. P. “Optimized Crossover for the Independent Set Problem,” Operations Research, 45(2):226–234, March–April 1997.
2. Bäck, T. and Khuri, S. “An Evolutionary Heuristic for the Maximum Independent Set Problem,” in Proc. First IEEE Conference on Evolutionary Computation, IEEE Press, pp. 531–535, 1994.
3. Bar-Yehuda, R. and Even, S. “A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem,” Annals of Discrete Mathematics, 25:27–45, 1985.
4. Brglez, F., Bryan, D. and Kozminski, K. “Combinational Profiles of Sequential Benchmark Circuits,” in Proc. Intl. Symp. on Circuits and Systems, pp. 1929–1934, 1989.
5. Bui, T. N. and Eppley, P. H. “A Hybrid Genetic Algorithm for the Maximum Clique Problem,” in Proc. of the 6th ICGA, Morgan Kaufmann, pp. 478–484, 1995.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献