The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02522667.2001.10699482
+Normal rank
@@ Property / OpenAlex ID @@
+W2045758866
@@ Property / OpenAlex ID: W2045758866 / rank @@
+Normal rank
@@ Property / cites work @@
+Halin graphs and the travelling salesman problem
@@ Property / cites work: Halin graphs and the travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Bottleneck Traveling Salesman Problem
@@ Property / cites work: The Bottleneck Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3768703
@@ Property / cites work: Q3768703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2998795
@@ Property / cites work: Q2998795 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
+Normal rank
@@ Property / cites work @@
+Relaxed tours and path ejections for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The traveling salesman. Computational solutions for RSP applications
+Normal rank