Dijkstra’s Algorithm for Solving the Shortest Path Problem on Networks Under Intuitionistic Fuzzy Environment
JOURNAL OF MATHEMATICAL MODELLING AND ALGORITHMS ; 11 , 4 ; 345-359
2012-01-01
15 pages
Article (Journal)
English
DDC: | 003.3 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Finding Shortest Path in Road Networks Based on Jam-Distance Graph and Dijkstra’s Algorithm
Springer Verlag | 2022
|Solving Fuzzy Shortest Path Problem with Decision Maker’s Perspective
Springer Verlag | 2021
|Efficient Algorithms for Solving the Shortest Covering Path Problem
Online Contents | 1994
|An efficient dynamic model for solving the shortest path problem
Online Contents | 2013
|