An improved approximation algorithm for the maximum TSP (Q974748): Difference between revisions

@@ Property / cites work @@
+On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
+Normal rank
@@ Property / cites work @@
+An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
+Normal rank
@@ Property / cites work @@
+Differential approximation results for the traveling salesman problem with distances 1 and 2
+Normal rank
@@ Property / cites work @@
+Deterministic 7/8-approximation for the metric maximum TSP
+Normal rank
@@ Property / cites work @@
+On the relationship between ATSP and the cycle cover problem
+Normal rank
@@ Property / cites work @@
+An -approximation algorithm for the asymmetric maximum TSP
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the ATSP with parameterized triangle inequality
+Normal rank