How to Help a Traveling Salesman

Osječki matematički list

Bosančić, Velga¹  Golemac, Anka¹ 

[1]Prirodoslovno-matematički fakultet Sveučilišta u Splitu, Split, Hrvatska

关键词: TSP;    Hamiltonian cycle;    Algorithm;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Sveuciliste Josipa Jurja Strossmayera u Osijeku * Odjel za Matematiku / University of Osijek, Department of Mathematics

【 摘 要 】

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...

【 授权许可】

Unknown