Shahab Kareem, “Numerous Different Solution to TSP”, 19 Haziran 2015 (Çarşamba)

Bilgisayar Mühendisliği Bölümü Semineri #61:

	Başlık:	Numerous Different Solution to TSP
	Konuşmacı:	Shahab Kareem, Ph.D. candidate, Yasar University
	Tarih:	19 Haziran 2015 (Çarşamba)
	Saat:	16:00-16:45
	Yer:	Bilgisayar Ağları Laboratuvarı (Yeni bina B2. kat)
	Sunum Dili:	İngilizce

Özet: The difficulty with the TSP (Traveling Salesman Problem) is not that of finding an algorithm that computes the shortest tour, but to find an efficient one. Surprisingly, nobody has been able to find such a method and not for lack of good-will. The problem is quite relevant from the point of view of the applications, where it is encountered often and in different guises.