Order preserving reductions and polynomial improving paths (Q2583701): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2005.01.003
@@ Property / DOI: 10.1016/j.orl.2005.01.003 / rank @@
-Normal rank
@@ Property / cites work @@
+Analyzing the complexity of finding good neighborhood functions for local search algorithms
+Normal rank
@@ Property / cites work @@
+Polynomial transformations and data-independent neighborhood functions
+Normal rank
@@ Property / cites work @@
+Data-independent neighborhood functions and strict local optima
+Normal rank
@@ Property / cites work @@
+Approximate solution of NP optimization problems
@@ Property / cites work: Approximate solution of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation scheme preserving reducibility and its applications
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The effectiveness of finite improvement algorithms for finding global optima
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Hill Climbing with Multiple Local Optima
@@ Property / cites work: Hill Climbing with Multiple Local Optima / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2005.01.003
@@ Property / DOI: 10.1016/J.ORL.2005.01.003 / rank @@
+Normal rank