PENYELESAIAN MASALAH TRAVELING SALESMAN DENGAN PEMROGRAMAN DINAMIK

Simple item page
dc.contributor.authorMustafsiroh
dc.contributor.authorGamal, M. D. H
dc.contributor.authorNatsir, M.
dc.date.accessioned2012-10-15T03:08:25Z
dc.date.available2012-10-15T03:08:25Z
dc.date.issued2012-10-14
dc.description.abstractTraveling 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.en_US
dc.description.sponsorshipGamal, M. D. H, Natsir, M.en_US
dc.identifier.otherRangga Dwijunanda Putra
dc.identifier.urihttp://hdl.handle.net/123456789/176
dc.language.isootheren_US
dc.subjectTraveling salesman problemen_US
dc.subjectgraphen_US
dc.subjectHamilton circuiten_US
dc.subjectdinamik programmingen_US
dc.titlePENYELESAIAN MASALAH TRAVELING SALESMAN DENGAN PEMROGRAMAN DINAMIKen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
artikel_mustafsiroh 2.PDF
Size:
127.73 KB
Format:
Adobe Portable Document Format
Description:
full teks
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Mathematics