This paper reports on my exploration of the connections between the family of algorithms collectively known as the dual-tree approach, and the family of shortest-path problems in graphs. I explain why we might expect connections to exist, and the difficulties I encountered in applying the dual-tree method to shortest-path problems.

Shortest Path Problem where the time/cost have vague value is one of the most studied problems in Fuzzy sets and systems area. Thus numerous articles have focused on the Fuzzy Shortest Path Problem (FSPP) in a network. This paper, presents the fuzzy shortest length heuristic procedure if the length of the path in the network is trapezoidal fuzzy set where the highest similarity degree is utiliz...

We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K-shortest paths finding algorithm that may be efficient in many real cases. An applicati...