Nonoblivious 2-Opt heuristics for the traveling salesman problem (Q2811309): Difference between revisions

@@ Property / cites work @@
+New local search approximation techniques for maximum generalized satisfiability problems
+Normal rank
@@ Property / cites work @@
+A Survey of Approximation Results for Local Search Algorithms
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Randomized Rounding Approach to the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Theoretical aspects of local search.
@@ Property / cites work: Theoretical aspects of local search. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Local Search in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank