An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem


The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem… (More)
DOI: 10.1016/j.asoc.2011.05.023


6 Figures and Tables


Citations per Year

70 Citations

Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.