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...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
MDPI AG
2023-05-01
|
| Col·lecció: | Applied Sciences |
| Matèries: | |
| Accés en línia: | https://www.mdpi.com/2076-3417/13/11/6417 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|