Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622)

From MaRDI portal
Revision as of 06:01, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
scientific article

    Statements

    Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    Shortest paths
    0 references
    Fixed nodes
    0 references
    Time-dependent
    0 references
    Travel planning
    0 references

    Identifiers