Well-solved cases of the 2-peripatetic salesman problem (Q4351794): 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/02331939708844286
+Normal rank
@@ Property / OpenAlex ID @@
+W2080771472
@@ Property / OpenAlex ID: W2080771472 / rank @@
+Normal rank
@@ Property / cites work @@
+Two edge-disjoint hamiltonian cycles in the butterfly graph
+Normal rank
@@ Property / cites work @@
+Efficiently solvable special cases of bottleneck travelling salesman problems
+Normal rank
@@ Property / cites work @@
+The convex-hull-and-line traveling salesman problem: A solvable case
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for symmetric 2-peripatetic salesman problems
+Normal rank
@@ Property / cites work @@
+Solvable cases of the \(k\)-person Chinese postman problem
+Normal rank
@@ Property / cites work @@
+An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4351794