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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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.
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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49L20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / rank
 
Normal rank
Property / zbMATH DE Number
 
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

Revision as of 09:42, 28 June 2023

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