Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843): Difference between revisions

@@ Property / cites work @@
+A new approach for modeling and solving set packing problems
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+Reactive and dynamic local search for max-clique: engineering effective building blocks
+Normal rank
@@ Property / cites work @@
+Reactive local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+A new trust region technique for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+Local search with edge weighting and configuration checking heuristics for minimum vertex cover
+Normal rank
@@ Property / cites work @@
+GRASP for set packing problems.
@@ Property / cites work: GRASP for set packing problems. / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood portfolio approach for local search applied to timetabling problems
+Normal rank
@@ Property / cites work @@
+STABULUS: A technique for finding stable sets in large graphs with tabu search
+Normal rank
@@ Property / cites work @@
+Solving the maximum clique problem using a tabu search approach
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+An effective local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Data dependent worst case bounds for weighted set packing
+Normal rank
@@ Property / cites work @@
+An augmentation algorithm for the maximum weighted stable set problem
+Normal rank
@@ Property / cites work @@
+Q4547547
@@ Property / cites work: Q4547547 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum vertex/edge weighted clique using local search
+Normal rank
@@ Property / cites work @@
+Q3623999
@@ Property / cites work: Q3623999 / rank @@
+Normal rank
@@ Property / cites work @@
+An adaptive multistart tabu search approach to solve the maximum clique problem
+Normal rank