A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem (Q3541797): Difference between revisions

@@ Property / cites work @@
+Q5302102
@@ Property / cites work: Q5302102 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471353
@@ Property / cites work: Q4471353 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Q3274170
@@ Property / cites work: Q3274170 / rank @@
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Survivable network design with degree or order constraints
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252438
@@ Property / cites work: Q4252438 / rank @@
+Normal rank