Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10852-007-9070-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2006608876
@@ Property / OpenAlex ID: W2006608876 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365126
@@ Property / cites work: Q4365126 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of local search for the \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Q4365136
@@ Property / cites work: Q4365136 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687948
@@ Property / cites work: Q5687948 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
+Normal rank
@@ Property / cites work @@
+Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
+Normal rank
@@ Property / cites work @@
+Q3829367
@@ Property / cites work: Q3829367 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the p-median
@@ Property / cites work: Variable neighborhood search for the p-median / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+Drift analysis and average time complexity of evolutionary algorithms
+Normal rank
@@ Property / cites work @@
+Q4365133
@@ Property / cites work: Q4365133 / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Evolution algorithms in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4223673
@@ Property / cites work: Q4223673 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
+Normal rank
@@ Property / cites work @@
+The analysis of evolutionary algorithms on sorting and shortest paths problems
+Normal rank
@@ Property / cites work @@
+Q4365127
@@ Property / cites work: Q4365127 / rank @@
+Normal rank