The Minimum Spanning Tree Problem on networks with Neutrosophic numbers
The minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs. This represents a vital and fundamental issue in the realm of combinational optimization problems (COP). Supply chain manageme...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2024-01-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/SpanningTree16.pdf |