Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367): Difference between revisions

@@ Property / cites work @@
+Travelling Salesman and Assignment Problems: A Survey
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On the refinement of bounds of heuristic algorithms for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems
+Normal rank
@@ Property / cites work @@
+Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
+Normal rank
@@ Property / cites work @@
+Identification of non-optimal arcs for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
+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 / cites work @@
+Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
+Normal rank