# A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem

Mathematica Balkanica New Series (2010)

- Volume: 24, Issue: 3-4, page 267-273
- ISSN: 0205-3217

## Access Full Article

top## Abstract

top## How to cite

topMilanović, Marija. "A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem." Mathematica Balkanica New Series 24.3-4 (2010): 267-273. <http://eudml.org/doc/11347>.

@article{Milanović2010,

abstract = {AMS Subj. Classiﬁcation: 90C27, 05C85, 90C59The 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 ﬁrst problems shown to be NP-hard. The deﬁnition 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.},

author = {Milanović, Marija},

journal = {Mathematica Balkanica New Series},

keywords = {Vertex Cover; Genetic Algorithm; Evolutionary Approach; Combinatorial Optimization; Graph Algorithms; vertex cover; genetic algorithm; evolutionary approach; combinatorial optimization; graph algorithms},

language = {eng},

number = {3-4},

pages = {267-273},

publisher = {Bulgarian Academy of Sciences - National Committee for Mathematics},

title = {A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem},

url = {http://eudml.org/doc/11347},

volume = {24},

year = {2010},

}

TY - JOUR

AU - Milanović, Marija

TI - A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem

JO - Mathematica Balkanica New Series

PY - 2010

PB - Bulgarian Academy of Sciences - National Committee for Mathematics

VL - 24

IS - 3-4

SP - 267

EP - 273

AB - AMS Subj. Classiﬁcation: 90C27, 05C85, 90C59The 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 ﬁrst problems shown to be NP-hard. The deﬁnition 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.

LA - eng

KW - Vertex Cover; Genetic Algorithm; Evolutionary Approach; Combinatorial Optimization; Graph Algorithms; vertex cover; genetic algorithm; evolutionary approach; combinatorial optimization; graph algorithms

UR - http://eudml.org/doc/11347

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.