Mustafa, Mamat and Suyudi, M. and Sukono, . and Bon, A.T. (2019) Solving traveling salesman problems using branch and bound methods. In: 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019, 23-26 July 2019, Park Hotel Congress Center PilsenPilsen; Czech Republic.
![[img]](http://eprints.unisza.edu.my/style/images/fileicons/text.png) |
Text
FH03-FIK-20-38046.pdf Restricted to Registered users only Download (293kB) |
Abstract
The traveling salesman problem is a well known optimization problem. Optimal solutions to small instances can be found in reasonable time by linear programming. However, since the TSP is NP-hard, it will be very time consuming to solve larger instances with guaranteed optimality. Setting optimality aside, there's a bunch of algorithms offering comparably fast running time and still yielding near optimal solutions. Therefore, in this study we will examine the search for solving TSP problem using branch and bound methods.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Branch and bound, The greedy heuristic, Traveling salesman problem |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Informatics & Computing |
| Depositing User: | Muhammad Akmal Azhar |
| Date Deposited: | 23 Nov 2020 06:16 |
| Last Modified: | 23 Nov 2020 06:16 |
| URI: | http://eprints.unisza.edu.my/id/eprint/1836 |
Actions (login required)
 |
View Item |
