Application of Dynamic Programming in Solving TSP Problem

Published in Institut Teknologi Bandung, 2016

Type of Paper

Academic Paper for lecture of IF2211 Algorithm Strategy
Computer Science, Institut Teknologi Bandung
Bandung, Indonesia

Abstract

Travelling Salesman Problem or TSP is a problem where a salesman has to visit all cities in which each city must only be visited once. In addition, he has to come back to the first city with the minimum value of total distance of adventure.

One of the algorithms to solve this problem is Held-Karp algorithm which is a child of Dynamic Programming. This algorithms was specially created to solve any problems which are similar to the TSP problem.

Download paper here