An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197): Difference between revisions

@@ 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/j.orl.2004.09.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1993298089
@@ Property / OpenAlex ID: W1993298089 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4250161
@@ Property / cites work: Q4250161 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Traveling Salesman Problem with Range Condition
+Normal rank
@@ Property / cites work @@
+Q4187840
@@ Property / cites work: Q4187840 / rank @@
+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 @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+Analyzing the Held-Karp TSP bound: A monotonicity property with application
+Normal rank
@@ Property / cites work @@
+Heuristic analysis, linear programming and branch and bound
+Normal rank