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

@@ Property / DOI @@
-.1007/s10878-015-9909-3
@@ Property / DOI: 10.1007/s10878-015-9909-3 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6620833
@@ Property / zbMATH DE Number: 6620833 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum weight vertex cover problem
@@ Property / zbMATH Keywords: minimum weight vertex cover problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tabu search
@@ Property / zbMATH Keywords: tabu search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fast evaluation strategy
@@ Property / zbMATH Keywords: fast evaluation strategy / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+perturbation
@@ Property / zbMATH Keywords: perturbation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+meta-heuristic
@@ Property / zbMATH Keywords: meta-heuristic / rank @@
+Normal rank
@@ 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.1007/s10878-015-9909-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1873423029
@@ Property / OpenAlex ID: W1873423029 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1007/S10878-015-9909-3
@@ Property / DOI: 10.1007/S10878-015-9909-3 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:306082