A 1.5-Approximation for Symmetric Euclidean Open Loop TSP
Travelling Salesman Problem (TSP) is NP-hard and therefore lacks efficient algorithm that provides optimal solution. So far, a benchmark in this area is Christofides’ Algorithm, which provides an upper bound of 3/2 for metric TSP. In this paper, it is shown that a simple nearest neighbor heur...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
IEEE
2024-01-01
|
| Serie: | IEEE Access |
| Soggetti: | |
| Accesso online: | https://ieeexplore.ieee.org/document/10702593/ |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|