Dynamic programming approaches to solve the shortest path problem with forbidden paths (Q4924113)

From MaRDI portal
Revision as of 11:07, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6168651
Language Label Description Also known as
English
Dynamic programming approaches to solve the shortest path problem with forbidden paths
scientific article; zbMATH DE number 6168651

    Statements

    title
    Dynamic programming approaches to solve the shortest path problem with forbidden paths (English)
    0 references
    publication date
    30 May 2013
    0 references
    zbMATH Keywords
    shortest path problem
    0 references
    forbidden paths
    0 references
    dynamic programming
    0 references
    cites work
    Q4225395
    0 references
    Q4198056
    0 references
    Q2753949
    0 references

    Identifiers

    zbMATH DE Number
    6168651
    0 references
    OpenAlex ID
    W2033829723
    0 references
    Wikidata QID
    Q58921148
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4924113&oldid=35334325"
    Powered by MediaWiki