Distance conserving reductions for nonoriented networks (Q594774): Difference between revisions

@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4174517
@@ Property / cites work: Q4174517 / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem: Solution of a 120-city problem
+Normal rank
@@ Property / cites work @@
+Distance matrix of a graph and its realizability
@@ Property / cites work: Distance matrix of a graph and its realizability / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
+Normal rank
@@ Property / cites work @@
+Using cutting planes to solve the symmetric Travelling Salesman problem
+Normal rank