The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/0377-2217(83)90161-3
-Normal rank
@@ Property / OpenAlex ID @@
-W2032527321
@@ Property / OpenAlex ID: W2032527321 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(83)90161-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2032527321
@@ Property / OpenAlex ID: W2032527321 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
+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 @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+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 @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Identification of non-optimal arcs for the traveling salesman problem
+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 @@
+Q4145160
@@ Property / cites work: Q4145160 / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank
@@ Property / cites work @@
+The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
+Normal rank