Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885)

From MaRDI portal
Revision as of 23:50, 29 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
Shortest path problems with partial information: Models and algorithms for detecting dominance
scientific article

    Statements

    Shortest path problems with partial information: Models and algorithms for detecting dominance (English)
    0 references
    0 references
    0 references
    19 March 2000
    0 references
    0 references
    network programming
    0 references
    partial information
    0 references
    multicriteria analysis
    0 references