A travelling salesman problem (TSP) with multiple job facilities. (Q2467832): Difference between revisions

@@ Property / cites work @@
+Q5646673
@@ Property / cites work: Q5646673 / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for Solving Traveling-Salesman Problems
@@ Property / cites work: A Method for Solving Traveling-Salesman Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem
@@ Property / cites work: The Traveling-Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relation Between the Traveling-Salesman and the Longest-Path Problems
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Loading Problem
@@ Property / cites work: The Loading Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Travelling purchaser problem
@@ Property / cites work: Travelling purchaser problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5563210
@@ Property / cites work: Q5563210 / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf03398645
+Normal rank
@@ Property / OpenAlex ID @@
+W2773469893
@@ Property / OpenAlex ID: W2773469893 / rank @@
+Normal rank