Shortest path calculation in large road networks (Q1384218)

From MaRDI portal
Revision as of 11:10, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shortest path calculation in large road networks
scientific article

    Statements

    title
    Shortest path calculation in large road networks (English)
    0 references
    author
    Gerhard Ertl
    0 references
    published in
    OR Spektrum
    0 references
    publication date
    13 April 1998
    0 references
    zbMATH Keywords
    shortest path
    0 references
    transportation planning
    0 references
    road network
    0 references
    preprocessing algorithm
    0 references
    cites work
    Q3722287
    0 references
    Q4855437
    0 references

    Identifiers

    DOI
    10.1007/BF01545524
    0 references
    Mathematics Subject Classification ID
    90B06
    0 references
    90C90
    0 references
    90C35
    0 references
    zbMATH DE Number
    1140245
    0 references
    OpenAlex ID
    W2072208720
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1384218&oldid=37416137"
    Powered by MediaWiki