A Labelling Method for the Travelling Salesman Problem
The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized. We propose a labelling method to solve the TSP problem. The...
Shranjeno v:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
MDPI AG
2023-05-01
|
| Serija: | Applied Sciences |
| Teme: | |
| Online dostop: | https://www.mdpi.com/2076-3417/13/11/6417 |
| Oznake: |
Brez oznak, prvi označite!
|