An experimental comparison of three heuristics for the WVCP (Q1328615): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(94)90160-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2038006607
@@ Property / OpenAlex ID: W2038006607 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994799
@@ Property / cites work: Q3994799 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Q3277097
@@ Property / cites work: Q3277097 / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Can Parallel Branch and Bound without Communication Be Effective?
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1328615