A simple LP relaxation for the asymmetric traveling salesman problem (Q378136): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-012-0544-9
@@ Property / DOI: 10.1007/s10107-012-0544-9 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-012-0544-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2010462135
@@ Property / OpenAlex ID: W2010462135 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417632
@@ Property / cites work: Q5417632 / rank @@
+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 Integrality Ratio for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+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 @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Survivable Network Design with Degree or Order Constraints
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252438
@@ Property / cites work: Q4252438 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10107-012-0544-9
@@ Property / DOI: 10.1007/S10107-012-0544-9 / rank @@
+Normal rank