An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem

• Published in: Annals of operations research Vol. 131; no. 1-4; pp. 283 - 304
• Main Authors: Shyu, Shyong Jian, Yin, Peng-Yeng, Lin, Bertrand M.T.
• Format: Journal Article
• Language: English
• Published: New York Springer Nature B.V 01.10.2004
• Subjects: Algorithms; Approximation; Heuristic; Operations research; Optimization; Optimization algorithms; Performance evaluation; Pheromones; Studies; Transition rules; Traveling salesman problem

Given an undirected graph and a weighting function defined on the vertex set, the minimum weight vertex cover problem is to find a vertex subset whose total weight is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we introduce a meta-heuristic...