On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097): Difference between revisions

@@ Property / author @@
+Frank Koerner
@@ Property / author: Frank Koerner / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(86)90188-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1966089951
@@ Property / OpenAlex ID: W1966089951 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3039069
@@ Property / cites work: Q3039069 / rank @@
+Normal rank
@@ Property / cites work @@
+Travelling Salesman and Assignment Problems: A Survey
+Normal rank
@@ Property / cites work @@
+An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Approximate Traveling Salesman Algorithms
@@ Property / cites work: Approximate Traveling Salesman Algorithms / rank @@
+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 @@
+A Patching Algorithm for the Nonsymmetric 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