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

From MaRDI portal
Revision as of 19:58, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q926598)
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
    19 March 2000
    0 references
    0 references
    network programming
    0 references
    partial information
    0 references
    multicriteria analysis
    0 references
    0 references