An efficient approach for traveling salesman problem solution with branch-and-bound

Travelling salesman problem is a known problem. In this paper will be used method of branch-and-Bound efficient to solve the problem Traveling salesman. Tour starts from a given starting vertex and all vertices to be passed, then returned to the initial vertex. Costs given a different path. Furtherm...

Full description

Bibliographic Details

Main Authors:	Mustafa, Mamat, Suyudi, M., Sukono, .
Format:	Conference or Workshop Item
Language:	en
Published:	2016
Subjects:	QA75 Electronic computers. Computer science T Technology (General)
Online Access:	http://eprints.unisza.edu.my/777/1/FH03-FIK-17-09078.jpg http://eprints.unisza.edu.my/777/
Tags:	Add Tag No Tags, Be the first to tag this record!