PERANCANGAN DAN IMPLEMENTASI MULTI TRAVELING SALESMAN PROBLEM (M-TSP) DENGAN ALGORITMA SIRKUIT HAMILTON MENGGUNAKAN METODE BRANCH AND BOUND DAN UNTUK PENDISTRIBUSIAN BARANG

Pamungkas, Agoeng (2007) PERANCANGAN DAN IMPLEMENTASI MULTI TRAVELING SALESMAN PROBLEM (M-TSP) DENGAN ALGORITMA SIRKUIT HAMILTON MENGGUNAKAN METODE BRANCH AND BOUND DAN UNTUK PENDISTRIBUSIAN BARANG. Diploma thesis, Universitas Komputer Indonesia.

Full text not available from this repository.
Official URL: http://elib.unikom.ac.id/gdl.php?mod=browse&op=rea...

Abstract

Along fast progreessively growth of communications technology which in such a way go forward so that in this time phone seluler not only to justly converse, but passing a ponsel we earn to know all kinds of information, one of them information able to be accessed to through facility of SMS for the request of song. By paying attention that thing is, hence song request have to be paid attention because during the time radio broadcast song request and twiddling of its song still conducted manually. Reached result of making of system of SMS Request to give amenity of request of song through service of SMS so that can improve work productivity at radio station.

Item Type: Thesis (Diploma)
Subjects: S1-Final Project > Fakultas Teknik Dan Ilmu Komputer > Teknik Informatika > 2007
Divisions: Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer
Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer > Teknik Informatika (S1)
Depositing User: Admin Repository
Date Deposited: 16 Nov 2016 07:46
Last Modified: 16 Nov 2016 07:46
URI: http://repository.unikom.ac.id/id/eprint/10447

Actions (login required)

View Item View Item