Dynamic programming method in extremal constrained routing problems (Q357046)

From MaRDI portal
Revision as of 17:11, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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