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...
Saved in:
Main Authors: | Mustafa, Mamat, Suyudi, M., Sukono, . |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2016
|
Subjects: | |
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!
|
Similar Items
-
Solving traveling salesman problems using branch and bound methods
by: Mustafa, Mamat, et al.
Published: (2019) -
Branch and bound algorithm for finding the maximum clique problem
by: Suyudi, M., et al.
Published: (2018) -
Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
by: Shakila, Saad, et al.
Published: (2014) -
Solution of maximum clique problem by using branch and bound method
by: Mustafa, Mamat, et al.
Published: (2014) -
Solving traveling salesman problem on cluster compute nodes
by: I.A., Aziz, et al.
Published: (2009)