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...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
MDPI AG
2023-05-01
|
| 叢編: | Applied Sciences |
| 主題: | |
| 在線閱讀: | https://www.mdpi.com/2076-3417/13/11/6417 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|