Branch Mathematics and Statistics Faculty and Staff Publications
Document Type
Article
Publication Date
7-2017
Abstract
In this research paper, a new approach is proposed for computing the shortest path length from source node to destination node in a neutrosophic environment. The edges of the network are assigned by trapezoidal fuzzy neutrosophic numbers. A numerical example is provided to show the performance of the proposed approach.
Publication Title
Computing Conference 2017 18-20 July 2017 | London , UK
First Page
142
Last Page
148
Language (ISO)
English
Keywords
neutrosophic sets; trapezoidal neutrosophic sets; shortest path problem; score function
Recommended Citation
Smarandache, Florentin; Said Broumi; Mohamed Talea; and Assia Bakali. "Shortest Path Problem under Trapezoidal Neutrosophic Information." Computing Conference 2017 18-20 July 2017 | London , UK (2017): 142-148. https://digitalrepository.unm.edu/math_fsp/417
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Included in
Construction Engineering and Management Commons, Mathematics Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Other Civil and Environmental Engineering Commons
