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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:04, 5 March 2024

scientific article
Language Label Description Also known as
English
Dynamic programming method in extremal constrained routing problems
scientific article

    Statements

    Dynamic programming method in extremal constrained routing problems (English)
    0 references
    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

    Identifiers