Computational experience with an algorithm for finding the k shortest paths in a network (Q4055399)

From MaRDI portal
Revision as of 15:41, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q954057)
scientific article
Language Label Description Also known as
English
Computational experience with an algorithm for finding the k shortest paths in a network
scientific article

    Statements

    title
    Computational experience with an algorithm for finding the k shortest paths in a network (English)
    0 references
    DOI
    10.6028/jres.078B.020
    0 references
    publication date
    1974
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    05C35
    0 references
    05-04
    0 references
    65K05
    0 references
    zbMATH DE Number
    3471807
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4055399&oldid=22233847"
    Powered by MediaWiki