PENYELESAIAN MASALAH TRAVELING SALESMAN DENGAN PEMROGRAMAN DINAMIK

dc.contributor.author	Mustafsiroh
dc.contributor.author	Gamal, M. D. H
dc.contributor.author	Natsir, M.
dc.date.accessioned	2012-10-15T03:08:25Z
dc.date.available	2012-10-15T03:08:25Z
dc.date.issued	2012-10-14
dc.identifier.other	Rangga Dwijunanda Putra
dc.identifier.uri	http://hdl.handle.net/123456789/176
dc.description.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 ﬁnd optimal solution.	en_US
dc.description.provenance	Submitted by Rangga Dwijunanda Putra (rangga.madridista@gmail.com) on 2012-10-15T03:08:25Z No. of bitstreams: 1 artikel_mustafsiroh 2.PDF: 130795 bytes, checksum: de2fbc5882fb3fa98c109bd29a6e9495 (MD5)	en
dc.description.provenance	Made available in DSpace on 2012-10-15T03:08:25Z (GMT). No. of bitstreams: 1 artikel_mustafsiroh 2.PDF: 130795 bytes, checksum: de2fbc5882fb3fa98c109bd29a6e9495 (MD5)	en
dc.description.sponsorship	Gamal, M. D. H, Natsir, M.	en_US
dc.language.iso	other	en_US
dc.subject	Traveling salesman problem	en_US
dc.subject	graph	en_US
dc.subject	Hamilton circuit	en_US
dc.subject	dinamik programming	en_US
dc.title	PENYELESAIAN MASALAH TRAVELING SALESMAN DENGAN PEMROGRAMAN DINAMIK	en_US
dc.type	Article	en_US