Improving Christofides' lower bound for the traveling salesman problem (Q3698662): 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.1080/02331938508843068
+Normal rank
@@ Property / OpenAlex ID @@
+W2043988891
@@ Property / OpenAlex ID: W2043988891 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Bounds for the Travelling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+On the Relation Between the Traveling-Salesman and the Longest-Path Problems
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
+Normal rank
@@ Property / cites work @@
+Identification of non-optimal arcs for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Nonoptimal Edges for the Symmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On dual solutions of the linear assignment problem
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3698662