Bulgarian Academy of Sciences - National Committee for Mathematics
Citation:
Mathematica Balkanica New Series, Vol. 24, Fasc 3-4 (2010), 267p-273p
Abstract:
The topic is related to solving the generalized vertex cover problem (GVCP) by genetic
algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem
which was one of the first problems shown to be NP-hard. The definition of the GVCP and
basics of genetic algorithms are described. Details of genetic algorithm and numerical results
are presented in [8]. Genetic algorithm obtained high quality solutions in a short period of
time.
