1 hasil
Menampilkan 1–1 · 0,04 detik · RSS
Jurnal
Operations Research Forum
Scopus
ISSN 2662-2556 · Springer Nature · 1 artikel di indeks
-
Artikel Jurnal Teks lengkap
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Abstract An O( n 3 ) heuristic algorithm is described for solving d -city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves as substeps the computation of a shortest spanning tree of the graph G defining the TSP and the finding of a…