An ant colony optimization algorithm for the minimum weight vertex cover problem

DOI10.1023/B:ANOR.0000039523.95673.33zbMath1066.90135OpenAlexW1963831867MaRDI QIDQ702732

Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin

Publication date: 17 January 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000039523.95673.33

zbMATH Keywords

minimum weight vertex covermeta-heuristic algorithmAnt colony optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (16)

Multi-start iterated tabu search for the minimum weight vertex cover problem ⋮ Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ Towards faster local search for minimum weight vertex cover on massive graphs ⋮ Local search with edge weighting and configuration checking heuristics for minimum vertex cover ⋮ Unnamed Item ⋮ An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) ⋮ Exact solutions to generalized vertex covering problems: a comparison of two models ⋮ Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique ⋮ Finding the longest common subsequence for multiple biological sequences by ant colony optimization ⋮ A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem ⋮ Ant colony optimization for the nonlinear resource allocation problem ⋮ An efficient local search framework for the minimum weighted vertex cover problem ⋮ USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS ⋮ A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM ⋮ Improved multiobjective differential evolution with spherical pruning algorithm for optimizing 3D printing technology parametrization process ⋮ Looking ahead with the pilot method

This page was built for publication: An ant colony optimization algorithm for the minimum weight vertex cover problem