Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033): Difference between revisions

@@ Property / cites work @@
+The Traveling Salesman Problem: A Survey
@@ Property / cites work: The Traveling Salesman Problem: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5550291
@@ Property / cites work: Q5550291 / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for Solving Traveling-Salesman Problems
@@ Property / cites work: A Method for Solving Traveling-Salesman Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem
@@ Property / cites work: The Traveling-Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q5581642
@@ Property / cites work: Q5581642 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Optimizing
@@ Property / cites work: Discrete Optimizing / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on the Efficiency of Hashing Functions
@@ Property / cites work: A Note on the Efficiency of Hashing Functions / rank @@
+Normal rank