A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem
| Data(s) |
27/12/2010
27/12/2010
2010
|
|---|---|
| Resumo |
AMS Subj. Classification: 90C27, 05C85, 90C59 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. |
| Identificador |
Mathematica Balkanica New Series, Vol. 24, Fasc 3-4 (2010), 267p-273p 0205-3217 |
| Idioma(s) |
en |
| Publicador |
Bulgarian Academy of Sciences - National Committee for Mathematics |
| Palavras-Chave | #Vertex Cover #Genetic Algorithm #Evolutionary Approach #Combinatorial Optimization #Graph Algorithms |
| Tipo |
Article |
