PENYELESAIAN MASALAH TRAVELING SALESMAN DENGAN PEMROGRAMAN DINAMIK

No Thumbnail Available

Date

2012-10-14

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Traveling 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.

Description

Keywords

Traveling salesman problem, graph, Hamilton circuit, dinamik programming

Citation

Collections