Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362)

From MaRDI portal
Revision as of 11:51, 7 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
Speeding up Martins' algorithm for multiple objective shortest path problems
scientific article

    Statements

    title
    Speeding up Martins' algorithm for multiple objective shortest path problems (English)
    0 references
    author
    Sofie Demeyer
    0 references
    Jan Goedgebeur
    0 references
    Pieter Audenaert
    0 references
    Mario Pickavet
    0 references
    Piet Demeester
    0 references
    published in
    4OR
    0 references
    publication date
    24 March 2014
    0 references
    zbMATH Keywords
    multiobjective shortest path problem
    0 references
    labeling algorithm
    0 references
    stop condition
    0 references
    bidirectional routing
    0 references
    Pareto optimal set
    0 references
    cites work
    On a routing problem
    0 references
    Q3888874
    0 references
    Q4426354
    0 references
    Multiobjective A*
    0 references
    Q3802899
    0 references
    Q4546246
    0 references
    Q4062203
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C29
    0 references
    05C85
    0 references
    05C38
    0 references
    68Q25
    0 references
    90B06
    0 references
    zbMATH DE Number
    6272775
    0 references
    OpenAlex ID
    W2075265540
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2441362&oldid=35379086"
    Powered by MediaWiki