The traveling-salesman problem and minimum spanning trees: Part II (Q5641007): Difference between revisions

@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem: A Survey
@@ Property / cites work: The Traveling Salesman Problem: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal assignments in an ordered set: An application of matroid theory
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/mp/HeldK71
@@ Property / DBLP publication ID: journals/mp/HeldK71 / rank @@
+Normal rank