Multi-start iterated tabu search for the minimum weight vertex cover problem

DOI10.1007/S10878-015-9909-3zbMath1353.90136OpenAlexW1873423029MaRDI QIDQ306082

Taoqing Zhou, Bo Peng, Yang Wang, Junwen Ding, Zhipeng Lü

Publication date: 31 August 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9909-3

zbMATH Keywords

perturbationtabu searchmeta-heuristicfast evaluation strategyminimum weight vertex cover problem

Mathematics Subject Classification ID

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

Related Items (3)

Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ Towards faster local search for minimum weight vertex cover on massive graphs ⋮ A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem

Cites Work

• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• Complexity and approximation of the connected set-cover problem
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Minimum vertex cover in ball graphs through local search
• Iterated tabu search for the circular open dimension problem
• Adaptive tabu search for course timetabling
• A Greedy Heuristic for the Set-Covering Problem
• Tabu Search—Part I
• On efficient fixed-parameter algorithms for weighted vertex cover
• A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
• Improved Parameterized Upper Bounds for Vertex Cover
• An approximation algorithm for the partial vertex cover problem in hypergraphs

This page was built for publication: Multi-start iterated tabu search for the minimum weight vertex cover problem