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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm for the ranking of shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty and Imprecision: Modelling and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Information, Dominance, and Potential Optimality in Multiattribute Utility Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for sensitivity analysis in discrete multi-objective decision-making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision making with incomplete information / rank
 
Normal rank

Latest revision as of 14:33, 29 May 2024

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
    19 March 2000
    0 references
    0 references
    network programming
    0 references
    partial information
    0 references
    multicriteria analysis
    0 references
    0 references