Dynamic programming method in extremal constrained routing problems (Q357046): Difference between revisions

A problem of routing control for an object to visit a finite collection of sets is considered under constraints that include precedence constraints. A dynamic programming based analysis is provided. An iterative solution scheme, also based on dynamic programming, is proposed. An illustrative example is given.

0 references

zbMATH Keywords

movement control

0 references

extremal constrained routing problems

0 references

dynamic programming

0 references

iterative solution

0 references

precedence constraints

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The traveling salesman problem. II: Exact methods

0 references

A modification of the dynamic programming method for the travelling-salesman problem

0 references

An assignment problem

0 references

On a generalization of the bottleneck traveling salesman problem

0 references

Solving the routing optimization problem using the dynamic programming method

0 references

Reduction of route optimization problems

0 references

On the solution of the problem of the sequential traversing of sets using a ``nonclosed'' traveling salesman problem.

0 references

Hybrid control systems and the dynamic traveling salesman problem

0 references

A generalized Courier problem with the cost function depending on the list of tasks

0 references

Dynamic programming method in the generalized courier problem

0 references

Extremal bottleneck routing problem with constraints in the form of precedence conditions

0 references

Identifiers

zbMATH Open document ID

1272.49044

0 references

DOI

10.1134/S1064230710030081

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:357046

@@ Property / review text @@
+A problem of routing control for an object to visit a finite collection of sets is considered under constraints that include precedence constraints. A dynamic programming based analysis is provided. An iterative solution scheme, also based on dynamic programming, is proposed. An illustrative example is given.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+L20
@@ Property / Mathematics Subject Classification ID: 49L20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B06
@@ Property / Mathematics Subject Classification ID: 90B06 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6192336
@@ Property / zbMATH DE Number: 6192336 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+movement control
@@ Property / zbMATH Keywords: movement control / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+extremal constrained routing problems
@@ Property / zbMATH Keywords: extremal constrained routing problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamic programming
@@ Property / zbMATH Keywords: dynamic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+iterative solution
@@ Property / zbMATH Keywords: iterative solution / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+precedence constraints
@@ Property / zbMATH Keywords: precedence constraints / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem. II: Exact methods
@@ Property / cites work: The traveling salesman problem. II: Exact methods / rank @@
+Normal rank
@@ Property / cites work @@
+A modification of the dynamic programming method for the travelling-salesman problem
+Normal rank
@@ Property / cites work @@
+An assignment problem
@@ Property / cites work: An assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+On a generalization of the bottleneck traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Solving the routing optimization problem using the dynamic programming method
+Normal rank
@@ Property / cites work @@
+Reduction of route optimization problems
@@ Property / cites work: Reduction of route optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the solution of the problem of the sequential traversing of sets using a ``nonclosed'' traveling salesman problem.
+Normal rank
@@ Property / cites work @@
+Hybrid control systems and the dynamic traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A generalized Courier problem with the cost function depending on the list of tasks
+Normal rank
@@ Property / cites work @@
+Dynamic programming method in the generalized courier problem
+Normal rank
@@ Property / cites work @@
+Extremal bottleneck routing problem with constraints in the form of precedence conditions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:357046