This paper aims to propose a new direct algorithm to solve the neutrosophic linear
programming where the variables and right-hand side represented with triangular …

In this paper, the theory of pentagonal neutrosophic number has been studied in a
disjunctive frame of reference. Moreover, the dependency and independency of the …

ABSTRACT The Travelling Salesman Problem (TSP) is one of the fundamental operational
research problems where the objective is to generate the cheapest route for a salesman …

Corporate sustainability reports' credibility of environmental, social, and governance (ESG)
information has received a significant focus of attention in the businesses landscape. Over …

The shortest path (SP) problem (SPP) has several applications in graph theory. It can be
used to calculate the distance between the provided initial and final vertex in a network. In …

Page 1 International Journal of Neutrosophic Science (IJNS) Vol. 4, No. 1, PP. 08-15, 2020
ASPG American Scientific Publishing Group 1 2 On Neutro-BE-algebras and Anti-BE-algebras …

Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the
shortest path problems (SPP). Several researchers have worked on fuzzy shortest path …

In this paper, authors disclose a new concept of pentagonal neutrosophic (PN) approach to
solve linear programming (LP) problem. To best of our insight, there is no approach for …

With the excessive consumption and pollution of water resources, the sustainable
development of water resources poses a serious threat currently. How to perceive and …

Shortest path problem (SPP) is an important and well-known combinatorial optimization
problem in graph theory. Uncertainty exists almost in every real-life application of SPP. The …