Bidirectional evolutionary heuristic for the minimum vertex-cover problem-Reference-Cited by-同舟云学术

Bidirectional evolutionary heuristic for the minimum vertex-cover problem

Published:2003-01 Issue:1 Volume:29 Page:111-120
ISSN:0045-7906
Container-title:Computers & Electrical Engineering
language:en
Short-container-title:Computers & Electrical Engineering

Author:

Karci Ali,Arslan Ahmet

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,General Computer Science,Control and Systems Engineering

Reference14 articles.

1. Karcı A, Çınar A, Ergen B. Genetik Algoritma Kullanılarak Minimum Düğüm Kapsama Probleminin Çozümü”. Elektrik–Eletronik Bilgisayar Mühendisliǧi 8. Gaziantep: Ulusal Kongresi; 1999

2. Karcı A, Çınar A. Comparison of uniform distributed initial population method and random initial population method in genetic search ISCIS. The 15th International Symposium on Computer and Information Sciences, 2000 11–13 October 2000, Istanbul, Turkey

3. Graph theory with applications;Bondy,1976

4. Graphs: theory and algorithms;Thulasiraman,1992

5. Cormen TH, Leiserson CE, Rivest RL. Introduction to algorithms. Cambridge: MIT Press; 1990. p. 968

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

1. Probability weighting effect in vertex cover of networks via prospect-theoretic learning;Journal of Communications and Networks;2023-04

2. A local search method based on edge age strategy for minimum vertex cover problem in massive graphs;Expert Systems with Applications;2021-11

3. Natural Inspired Computational Intelligence Method: Saplings Growing up Algorithm;2007 IEEE International Conference on Computational Cybernetics;2007-10

4. Thinking Capability of Saplings Growing Up Algorithm;Intelligent Data Engineering and Automated Learning – IDEAL 2006;2006

5. Imitation of Bee Reproduction as a Crossover Operator in Genetic Algorithms;PRICAI 2004: Trends in Artificial Intelligence;2004