Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming (Q3216467): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1287/opre.32.6.1381 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1287/OPRE.32.6.1381 / rank
 
Normal rank

Latest revision as of 22:14, 20 December 2024

scientific article
Language Label Description Also known as
English
Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
scientific article

    Statements

    Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming (English)
    0 references
    0 references
    0 references
    1984
    0 references
    all solutions
    0 references
    shortest path problems
    0 references
    depth-first search
    0 references
    stacking techniques
    0 references
    near-optimal policies
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references