Travelling Salesman Problems by branch and bound technique in Hindi with example| TSP | DAA
Автор: Xtra Lectures
Загружено: 2020-04-15
Просмотров: 314835
Описание:
The ‘Travelling salesman problem’ is very similar to the assignment problem except that in the former, there are additional restrictions that a salesman starts from his city, visits each city once and returns to his home city, so that the total distance (cost or time) is minimum.
Complexity Analysis:
Traveling salesman problem is a NP-hard problem. Until now, researchers have not found a polynomial time algorithm for traveling salesman problem. Among the existing algorithms, dynamic programming algorithm can solve the problem in time O(n^2*2^n) where n is the number of nodes in the graph. The branch-and-cut algorithm has been applied to solve the problem with a large number of nodes. However, branch-and-cut algorithm also has an exponential worst-case running time.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
