Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754)

From MaRDI portal
Revision as of 00:55, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Routing by ranking: a link analysis method for the constrained dial-a-ride problem
scientific article

    Statements

    title
    Routing by ranking: a link analysis method for the constrained dial-a-ride problem (English)
    0 references
    author
    Lauri Häme
    0 references
    Harri Hakula
    0 references
    publication date
    15 May 2014
    0 references
    zbMATH DE Number
    6295935
    0 references
    zbMATH Keywords
    dial-a-ride problem
    0 references
    link analysis
    0 references
    hits
    0 references
    topological ordering
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2450754&oldid=23597550"
    Powered by MediaWiki