MustafsirohGamal, M. D. HNatsir, M.2012-10-152012-10-152012-10-14Rangga Dwijunanda Putrahttp://hdl.handle.net/123456789/176Traveling salesman problem ia a problem in graph theory. This problem can be solved by enumurating all possible Hamilton circuit. Then we calculate the length of rute of each circuit, and then we choose the shortest circuit. For a large n, many of Hamilton circuits are examined. We discuss traveling salesman problem using dinamic programming to find optimal solution.otherTraveling salesman problemgraphHamilton circuitdinamik programmingArticle