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

DOI10.1016/S0377-2217(99)00005-3zbMath0959.90056OpenAlexW1984751469WikidataQ57641296 ScholiaQ57641296MaRDI QIDQ1969885

Luís C. Dias, Joao Carlos Namorado Climaco

Publication date: 19 March 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00005-3

zbMATH Keywords

network programmingmulticriteria analysispartial information

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Decision theory (91B06)

Related Items (8)

The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ An exact algorithm for the robust shortest path problem with interval data ⋮ On modelling and solving the shortest path problem with evidential weights ⋮ Optimization problems with evidential linear objective ⋮ A branch and bound algorithm for the robust shortest path problem with interval data. ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems

Cites Work

• Decision making with incomplete information
• A bicriterion shortest path algorithm
• A framework for sensitivity analysis in discrete multi-objective decision-making
• An algorithm for the ranking of shortest paths
• Robust discrete optimization and its applications
• Partial Information, Dominance, and Potential Optimality in Multiattribute Utility Theory
• Uncertainty and Imprecision: Modelling and Analysis
• Unnamed Item

This page was built for publication: Shortest path problems with partial information: Models and algorithms for detecting dominance