An experimental comparison of three heuristics for the WVCP

DOI10.1016/0377-2217(94)90160-0zbMath0811.90088OpenAlexW2038006607MaRDI QIDQ1328615

Per. S. Laursen

Publication date: 17 October 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90160-0

zbMATH Keywords

simulated annealinggreedy algorithmgraph algorithmsheuristic methodsweighted vertex cover problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• A Greedy Heuristic for the Set-Covering Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Can Parallel Branch and Bound without Communication Be Effective?
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An experimental comparison of three heuristics for the WVCP