Time depending shortest-path problems with applications to railway networks (Q1388936)

From MaRDI portal
Revision as of 11:40, 20 July 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 depending shortest-path problems with applications to railway networks
scientific article

    Statements

    Time depending shortest-path problems with applications to railway networks (English)
    0 references
    0 references
    5 January 1999
    0 references
    networks
    0 references
    shortest paths
    0 references
    transportation
    0 references
    rail
    0 references
    time depending transit network
    0 references
    public transport
    0 references
    label correcting method
    0 references

    Identifiers