MENENTUKAN LINTASAN TERPENDEK (SHORTEST PATH) DENGAN 0/1 KNAPSACK PROBLEM DAN PENDEKATAN ALGORITMA DYNAMIC PROGRAMMING
| Main Authors: | R, Iwan Fitrianto, Soetarno, Djoko |
|---|---|
| Format: | Article info application/pdf Journal |
| Bahasa: | eng |
| Terbitan: |
Universitas Raharja
, 2011
|
| Online Access: |
http://ejournal.raharja.ac.id/index.php/ccit/article/view/449 http://ejournal.raharja.ac.id/index.php/ccit/article/view/449/381 |
Internet
http://ejournal.raharja.ac.id/index.php/ccit/article/view/449http://ejournal.raharja.ac.id/index.php/ccit/article/view/449/381
Lokasi
| Koleksi | CCIT Journal |
|---|---|
| Gedung | Perpustakaan STMIK Raharja |
| Institusi | STMIK Raharja |
| Kota | KOTA TANGERANG |
| Provinsi | BANTEN |
| Kontak | Butuh informasi lebih lanjut? Hubungi pustakawan institusi ini. |