Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082): Difference between revisions

@@ Property / cites work @@
+Improved Parameterized Upper Bounds for Vertex Cover
+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 @@
+An approximation algorithm for the partial vertex cover problem in hypergraphs
+Normal rank
@@ Property / cites work @@
+Iterated tabu search for the circular open dimension problem
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive tabu search for course timetabling
@@ Property / cites work: Adaptive tabu search for course timetabling / rank @@
+Normal rank
@@ Property / cites work @@
+Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On efficient fixed-parameter algorithms for weighted vertex cover
+Normal rank
@@ Property / cites work @@
+A tabu search/path relinking algorithm to solve the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+An ant colony optimization algorithm for the minimum weight vertex cover problem
+Normal rank
@@ Property / cites work @@
+A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
+Normal rank
@@ Property / cites work @@
+Complexity and approximation of the connected set-cover problem
+Normal rank
@@ Property / cites work @@
+Minimum vertex cover in ball graphs through local search
+Normal rank