The traveling salesman problem: An update of research (Q3671783): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.3800300107
+Normal rank
@@ Property / OpenAlex ID @@
+W2050155999
@@ Property / OpenAlex ID: W2050155999 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4192099
@@ Property / cites work: Q4192099 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5602518
@@ Property / cites work: Q5602518 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Q5585859
@@ Property / cites work: Q5585859 / rank @@
+Normal rank
@@ Property / cites work @@
+A man-machine approach toward solving the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4119233
@@ Property / cites work: Q4119233 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Systematic generation of Hamiltonian circuits
@@ Property / cites work: Systematic generation of Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
+Normal rank
@@ Property / cites work @@
+Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
+Normal rank