Shahab Kareem, “Numerous Different Solution to TSP”, June 19, 2015 (Friday) – Yaşar Üniversitesi
Search

Shahab Kareem, “Numerous Different Solution to TSP”, June 19, 2015 (Friday)

Computer Engineering Department Seminar #61:

shahab-kareem Title: Numerous Different Solution to TSP
Speaker: Shahab Kareem, Ph.D. candidate, Yasar University
Date: June 19, 2015 (Friday)
Time: 16:00-16:45
Venue: Computer Networks Lab (New building, Level B2.)
Language: English

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