Dynamic programming method in extremal constrained routing problems (Q357046)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic programming method in extremal constrained routing problems |
scientific article; zbMATH DE number 6192336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming method in extremal constrained routing problems |
scientific article; zbMATH DE number 6192336 |
Statements
Dynamic programming method in extremal constrained routing problems (English)
0 references
29 July 2013
0 references
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
movement control
0 references
extremal constrained routing problems
0 references
dynamic programming
0 references
iterative solution
0 references
precedence constraints
0 references
0 references
0.8402937054634094
0 references
0.8241317272186279
0 references
0.8195778727531433
0 references
0.8168627619743347
0 references
0.8149126172065735
0 references
