Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111): Difference between revisions

@@ Property / cites work @@
+Fast local search for the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy randomized adaptive search procedures
@@ Property / cites work: Greedy randomized adaptive search procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple ingredients leading to very efficient heuristics for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Large Cliques Elude the Metropolis Process
@@ Property / cites work: Large Cliques Elude the Metropolis Process / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798257
@@ Property / cites work: Q3798257 / rank @@
+Normal rank
@@ Property / cites work @@
+A hybrid heuristic for the maximum clique problem
@@ Property / cites work: A hybrid heuristic for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank