Bounds for the symmetric 2-peripatetic salesman problem (Q4327897): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331939208843770
+Normal rank
@@ Property / OpenAlex ID @@
+W2086830346
@@ Property / OpenAlex ID: W2086830346 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for symmetric<i>K</i>-peripatetic salesman problems
+Normal rank
@@ Property / cites work @@
+Disjoint paths in a rectilinear grid
@@ Property / cites work: Disjoint paths in a rectilinear grid / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Q4068472
@@ Property / cites work: Q4068472 / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Disjoint paths in a network
@@ Property / cites work: Disjoint paths in a network / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank