Bidirectional evolutionary heuristic for the minimum vertex-cover problem

DOI10.1016/S0045-7906(01)00018-0MaRDI QIDQ1429748zbMATH OpenFDO

Authors Ahmet Arslan, Ali Karcı

Publication date 27 May 2004

Published in Computers and Electrical Engineering (Search for Journal in Brave)

zbMATH Keywords

partitioningGenetic algorithmsProblemMinimum vertex-cover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)

Recommendations

• On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms
• Fixed-parameter evolutionary algorithms and the vertex cover problem
• scientific article; zbMATH DE number 6303718
• scientific article; zbMATH DE number 19175
• Genetic algorithms applied to computationally difficult set covering problems

Cited in

(1)

• On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms

This page was built for publication: Bidirectional evolutionary heuristic for the minimum vertex-cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429748)