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

From MaRDI portal
Created claim: Wikidata QID (P12): Q57641296, #quickstatements; #temporary_batch_1704806754709
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q286527 / rank
Normal rank
 
Property / author
 
Property / author: Joao Carlos Namorado Climaco / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00005-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984751469 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:47, 30 July 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
    network programming
    0 references
    partial information
    0 references
    multicriteria analysis
    0 references

    Identifiers