An experimental comparison of three heuristics for the WVCP

DOI10.1016/0377-2217(94)90160-0MaRDI QIDQ1328615zbMATH OpenOpenAlexFDO

Authors 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

graph algorithmsgreedy algorithmheuristic methodssimulated annealingweighted vertex cover problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 19175
• A modified greedy heuristic for the set covering problem with improved worst case bound
• Analytical and experimental comparison of six algorithms for the vertex cover problem
• scientific article; zbMATH DE number 8779
• What is the best greedy-like heuristic for the weighted set covering problem?

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?
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(4)

• Metaheuristics: A bibliography
• scientific article; zbMATH DE number 4115526 (Why is no real title available?)
• Exact solutions to generalized vertex covering problems: a comparison of two models
• A multilevel evaluation method for heuristics with an application to the VRPTW

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

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