A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 13:06, 5 March 2024

scientific article
Language Label Description Also known as
English
A Reach and Bound algorithm for acyclic dynamic-programming networks
scientific article

    Statements

    A Reach and Bound algorithm for acyclic dynamic-programming networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    dynamic programming networks
    0 references
    shortest path problem
    0 references
    pruning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references