An effective local search for the maximum clique problem (Q1041822): Difference between revisions

@@ Property / describes a project that uses @@
+Max-AO
@@ Property / describes a project that uses: Max-AO / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / 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.1016/j.ipl.2005.05.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2108455025
@@ Property / OpenAlex ID: W2108455025 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56210425
@@ Property / Wikidata QID: Q56210425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+Chained Lin-Kernighan for Large Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Reactive local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Annealed replication: A new heuristic for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum stable set formulations and heuristics based on continuous optimization
+Normal rank
@@ Property / cites work @@
+Q2776559
@@ Property / cites work: Q2776559 / rank @@
+Normal rank
@@ Property / cites work @@
+Evolutionary computing
@@ Property / cites work: Evolutionary computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418383
@@ Property / cites work: Q4418383 / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247468
@@ Property / cites work: Q4247468 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4038710
@@ Property / cites work: Q4038710 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4472034
@@ Property / cites work: Q4472034 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy and local search heuristics for unconstrained binary quadratic programming
+Normal rank
@@ Property / cites work @@
+Q5321485
@@ Property / cites work: Q5321485 / rank @@
+Normal rank
@@ Property / cites work @@
+Combining the scalability of local search with the pruning techniques of systematic search
+Normal rank
@@ Property / cites work @@
+Q4452109
@@ Property / cites work: Q4452109 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495204
@@ Property / cites work: Q4495204 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1041822