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.

[img] Text (Abstract)
161414105.pdf
Download (542kB)
[img] Text (Full)
161414105_full.pdf
Restricted to Registered users only
Download (3MB)
Item Type: Thesis (Skripsi)
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Teacher Training and Education > Department of Mathematics Education
Depositing User: Y. Etik Supriyanti
Date Deposited: 19 Oct 2020 07:20
Last Modified: 19 Oct 2020 07:20
URI: http://repository.usd.ac.id/id/eprint/38248

Actions (login required)

View Item View Item
USD Repository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.