Mustafa, Mamat and Suyudi, M. and Sukono, . (2016) An efficient approach for traveling salesman problem solution with branch-and-bound. In: IEOM Detroit Conference, IEOM 2016, 23-25 Sep 2016, United States.
![[img]](http://eprints.unisza.edu.my/777/1/FH03-FIK-17-09078.jpg) |
Image
FH03-FIK-17-09078.jpg Restricted to Registered users only Download (136kB) |
Abstract
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. Furthermore ,will be found to the tour cost is minimal between the city (node) connected.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science T Technology > T Technology (General) |
| Divisions: | Faculty of Informatics & Computing |
| Depositing User: | Muhammad Akmal Azhar |
| Date Deposited: | 27 Oct 2020 06:22 |
| Last Modified: | 27 Oct 2020 06:22 |
| URI: | http://eprints.unisza.edu.my/id/eprint/777 |
Actions (login required)
 |
View Item |
