A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964)

From MaRDI portal
Revision as of 13:06, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A Reach and Bound algorithm for acyclic dynamic-programming networks
scientific article

    Statements

    title
    A Reach and Bound algorithm for acyclic dynamic-programming networks (English)
    0 references
    author
    Matthew D. Bailey
    0 references
    Robert L. Smith
    0 references
    Jeffrey M. Alden
    0 references
    published in
    Networks
    0 references
    publication date
    16 June 2009
    0 references
    zbMATH Keywords
    dynamic programming networks
    0 references
    shortest path problem
    0 references
    pruning
    0 references

    Identifiers

    DOI
    10.1002/net.20219
    0 references
    Mathematics Subject Classification ID
    90B10
    0 references
    05C85
    0 references
    90C39
    0 references
    zbMATH DE Number
    5565329
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3632964&oldid=28129323"
    Powered by MediaWiki