Sciweavers

IICAI
2003
14 years 1 months ago
A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
Ketan Kotecha, Nilesh Gambhava