On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965): Difference between revisions

@@ Property / cites work @@
+Q3039069
@@ Property / cites work: Q3039069 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Bounds for the Travelling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Tight bounds for christofides' traveling salesman heuristic
+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 @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Some Examples of Difficult Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01585662
+Normal rank
@@ Property / OpenAlex ID @@
+W4251552671
@@ Property / OpenAlex ID: W4251552671 / rank @@
+Normal rank