Cheapest paths in dynamic networks (Q4565769)

From MaRDI portal
Revision as of 12:39, 31 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6887368
Language Label Description Also known as
English
Cheapest paths in dynamic networks
scientific article; zbMATH DE number 6887368

    Statements

    Cheapest paths in dynamic networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2018
    0 references
    network flows
    0 references
    shortest path
    0 references
    time-dependent networks
    0 references
    time-expanded networks
    0 references
    branch and bound
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references