A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

DOI10.1142/S0217595906000905zbMATH Open1113.90137OpenAlexW2025716666MaRDI QIDQ5483436FDOQ5483436

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Greedy Heuristic for the Set-Covering Problem
• Title not available (Why is that?)
• Some optimal inapproximability results
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Ramsey numbers and an approximation algorithm for the vertex cover problem
• An improved fixed-parameter algorithm for vertex cover
• An ant colony optimization algorithm for the minimum weight vertex cover problem

Cited In (10)

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

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)