Branch and bound algorithm to solve travelling salesman problem in determining the shortest route to visit 5 potential tourist attraction in Kediri “ East Java with Website Based Display

Detail Tugas Akhir

Branch and bound algorithm to solve travelling salesman problem in determining the shortest route to visit 5 potential tourist attraction in Kediri “ East Java with Website Based Display

Maharani, Genta (2020) Branch and bound algorithm to solve travelling salesman problem in determining the shortest route to visit 5 potential tourist attraction in Kediri “ East Java with Website Based Display. Skripsi thesis, Sanata Dharma University.

Berkas Tugas Akhir

PDF

Text (Abstract)
161414105.pdf

Ukuran File (542kB)

PDF

Text (Full)
161414105_full.pdf
Restricted to Registered users only

Akses terbatas: khusus pengguna terdaftar Ukuran File (3MB)

Informasi Item

Item Type	Thesis (Skripsi)
Subjects	Q Science > QA Mathematics
Divisions	Faculty of Teacher Training and Education > Department of Mathematics Education
Date Deposited	19 Oct 2020 07:20
Last Modified	19 Oct 2020 07:20
URI	https://repository.usd.ac.id/id/eprint/38248

Actions (login required)

: View Item

Repositori USDPerpustakaan Universitas Sanata Dharma

Sekretariat 0274-880137 Ext: 1538 628112652539 library@usd.ac.id

Telusur

Layanan

Informasi

Kampus 2Jl. Affandi, Mrican, Caturtunggal, Kec. Depok, Kabupaten Sleman, Daerah Istimewa Yogyakarta 55281
PelayananSenin–Jumat, 07.30–21.00 WIB
Sabtu, 08.00–12.30 WIB
Libur kampus tutup.