Minimax routing problem with a system of priority tasks (Q6119971): Difference between revisions

@@ Property / cites work @@
+Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
+Normal rank
@@ Property / cites work @@
+A bottleneck routing problem with a system of priority tasks
+Normal rank
@@ Property / cites work @@
+Dynamic programming in the routing problem: decomposition variant
+Normal rank
@@ Property / cites work @@
+Two-stage dynamic programming in the routing problem with decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem. I: Theoretical issues
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations.
+Normal rank
@@ Property / cites work @@
+In Pursuit of the Traveling Salesman
@@ Property / cites work: In Pursuit of the Traveling Salesman / rank @@
+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 @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Q3281164
@@ Property / cites work: Q3281164 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5667133
@@ Property / cites work: Q5667133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank