New edges not used in shortest tours of TSP (Q1291639): Difference between revisions

@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038710
@@ Property / cites work: Q4038710 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Geometric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3720323
@@ Property / cites work: Q3720323 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem
@@ Property / cites work: The Traveling-Salesman Problem / rank @@
+Normal rank