10.5281/zenodo.1411229
https://zenodo.org/records/1411229
oai:zenodo.org:1411229
Said Broumi
Said Broumi
Assia Bakali
Assia Bakali
Mohamed Talea
Mohamed Talea
Florentin Smarandache
Florentin Smarandache
K. P. Krishnan Kishore
K. P. Krishnan Kishore
Rıdvan Şahin
Rıdvan Şahin
Shortest Path Problem Under Interval Valued Neutrosophic Setting
Zenodo
2018
2018-09-07
10.5281/zenodo.1411228
Creative Commons Attribution 4.0 International
This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here
each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.