A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784): Difference between revisions

@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast local search for the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum weighted independent set in an arbitrary graph
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+Q4547547
@@ Property / cites work: Q4547547 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-price approach for the maximum weight independent set problem
+Normal rank
@@ Property / cites work @@
+Genetic algorithmic approach to find the maximum weight independent set of a graph
+Normal rank
@@ Property / cites work @@
+Approximating the maximum vertex/edge weighted clique using local search
+Normal rank
@@ Property / cites work @@
+Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
+Normal rank
@@ Property / cites work @@
+Multi-neighborhood tabu search for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+Breakout local search for maximum clique problems
@@ Property / cites work: Breakout local search for maximum clique problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the maximum vertex weight clique problem via binary quadratic programming
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for cluster editing
@@ Property / cites work: Efficient algorithms for cluster editing / rank @@
+Normal rank