A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

DOI10.1142/S0217595906000905MaRDI QIDQ5483436zbMATH OpenOpenAlexFDO

Authors Alok Singh, Ashok Kumar Gupta

Publication date 14 August 2006

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595906000905

zbMATH Keywords

combinatorial optimizationminimum weight vertex covergreedy heuristicsteady-state genetic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Multi-start iterated tabu search for the minimum weight vertex cover problem
• scientific article; zbMATH DE number 6303718
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• scientific article; zbMATH DE number 19175
• An efficient local search framework for the minimum weighted vertex cover problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1131224 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• An improved fixed-parameter algorithm for vertex cover
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Ramsey numbers and an approximation algorithm for the vertex cover problem
• Some optimal inapproximability results

Cited in

(10)

• An articulation point-based approximation algorithm for minimum vertex cover problem
• A \((2-\varepsilon)\)-approximation ratio for vertex cover problem on special graphs
• On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms
• Exact and heuristic solution approaches for the generalized independent set problem
• Towards faster local search for minimum weight vertex cover on massive graphs
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• Multi-start iterated tabu search for the minimum weight vertex cover problem
• Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
• Weighted vertices optimizer (WVO): a novel metaheuristic optimization algorithm
• scientific article; zbMATH DE number 6303718 (Why is no real title available?)

This page was built for publication: A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

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