The First Resolution of the Travelling Salesman Problem under Neutrosophic Octagonal Fuzzy Environment
he Travelling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. Its objective is to identify the shortest cycle that visits every city precisely once before returning to the initial city. To the best of our knowledge there is no one in the literature w...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2025-04-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/16TravellingSalesman.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|