An approach to solution of the movements routing problem with several participants (Q357112): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+An assignment problem
@@ Property / cites work: An assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3738923
@@ Property / cites work: Q3738923 / rank @@
+Normal rank
@@ Property / cites work @@
+A modification of the dynamic programming method for the travelling-salesman problem
+Normal rank
@@ Property / cites work @@
+Dynamic programming method in the generalized courier problem
+Normal rank
@@ Property / cites work @@
+Reduction of route optimization problems
@@ Property / cites work: Reduction of route optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the routing optimization problem using the dynamic programming method
+Normal rank
@@ Property / cites work @@
+Partitioning a finite set by a dynamic programming method
+Normal rank
@@ Property / cites work @@
+Dynamic programming in the problem of decomposition optimization
+Normal rank
@@ Property / cites work @@
+Job distribution algorithms
@@ Property / cites work: Job distribution algorithms / rank @@
+Normal rank