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

From MaRDI portal
Revision as of 15:33, 9 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57641296, #quickstatements; #temporary_batch_1704806754709)
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
    0 references