A note on single alternating cycle neighborhoods for the TSP (Q2573008): Difference between revisions

@@ Property / cites work @@
+Q4339078
@@ Property / cites work: Q4339078 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Chained Lin-Kernighan for Large Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Geometric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Data Structures for Traveling Salesmen
@@ Property / cites work: Data Structures for Traveling Salesmen / rank @@
+Normal rank
@@ Property / cites work @@
+Ejection chains, reference structures and alternating path methods for traveling salesman problems
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365133
@@ Property / cites work: Q4365133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461911
@@ Property / cites work: Q4461911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4461910
@@ Property / cites work: Q4461910 / rank @@
+Normal rank