Using Depth First Search Algorithm For Travelling Salesman Problem

Wijaya, Ivan Tirta (2009) Using Depth First Search Algorithm For Travelling Salesman Problem. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0028 Ivan Tirta Wijaya COVER.pdf Download (540kB) | Preview
	Text (BAB I) 05.02.0028 Ivan Tirta Wijaya BAB I.pdf Restricted to Registered users only Download (115kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0028 Ivan Tirta Wijaya BAB II.pdf Restricted to Repository staff only Download (132kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0028 Ivan Tirta Wijaya BAB III.pdf Restricted to Repository staff only Download (116kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0028 Ivan Tirta Wijaya BAB IV.pdf Restricted to Repository staff only Download (118kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0028 Ivan Tirta Wijaya BAB V.pdf Restricted to Repository staff only Download (511kB)
	Text (BAB VI) 05.02.0028 Ivan Tirta Wijaya BAB VI.pdf Restricted to Registered users only Download (124kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0028 Ivan Tirta Wijaya DAFTAR PUSTAKA.pdf Download (124kB) | Preview

Abstract

Traveling Salesman Problem is one of the most intensively studied problems in computational mathematics. Travelling Salesman problem is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. Travelling Salesman Problem was invented by Hassler Whitney at Princeton. In the 1950s and 1960s, the problem became increasingly popular in scientific circles in Europe and the USA. These problems will be solved with depth first search algorithm and using tree data structures. Depth First Search is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:15
Last Modified:	27 Jan 2016 02:15
URI:	http://repository.unika.ac.id/id/eprint/7492

Actions (login required)

View Item