Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/1339

 Title: A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem Authors: Milanović, Marija Keywords: Vertex CoverGenetic AlgorithmEvolutionary ApproachCombinatorial OptimizationGraph Algorithms Issue Date: 2010 Publisher: 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 ﬁ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. Description: AMS Subj. Classiﬁcation: 90C27, 05C85, 90C59 URI: http://hdl.handle.net/10525/1339 ISSN: 0205-3217 Appears in Collections: Mathematica Balkanica New Series, Vol. 24, 2010, Fasc. 3-4

Files in This Item:

File Description SizeFormat