Professional paper
How to Help a Traveling Salesman
Velga Bosančić
; Prirodoslovno-matematički fakultet Sveučilišta u Splitu, Split, Hrvatska
Anka Golemac
; Prirodoslovno-matematički fakultet Sveučilišta u Splitu, Split, Hrvatska
Abstract
The Traveling Salesman Problem (TSP) is one of the most famous and most studied problems of combinatorial optimization. Its mathematical model consists of finding a minimum-weight Hamiltonian cycle in a weighted graph. This paper gives an overview of the TSP problem and its complexity throughout its history,
variants, solution methods, and applications.
Keywords
TSP; Hamiltonian cycle; Algorithm
Hrčak ID:
100526
URI
Publication date:
23.4.2013.
Visits: 4.174 *