Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194)

From MaRDI portal
Revision as of 19:50, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks
scientific article

    Statements

    title
    Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (English)
    0 references
    DOI
    10.1145/2670126
    0 references
    author
    Dominik Kirchler
    0 references
    Leo Liberti
    0 references
    Roberto Wolfler Calvo
    0 references
    publication date
    24 October 2016
    0 references
    Mathematics Subject Classification ID
    90B06
    0 references
    05C85
    0 references
    68Q45
    0 references
    90C35
    0 references
    zbMATH DE Number
    6642895
    0 references
    zbMATH Keywords
    ALT
    0 references
    constrained shortest paths
    0 references
    multimodal transportation network
    0 references
    regular languages
    0 references
    shortest path
    0 references
    OpenAlex ID
    W2150928468
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2828194&oldid=36282291"
    Powered by MediaWiki