Cover Image

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

Saved in:
Bibliographic Details
Main Authors: Mustafa, Mamat, Suyudi, M., Sukono, .
Format: Conference or Workshop Item
Language:English
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!
id my-unisza-ir.777
record_format eprints
spelling my-unisza-ir.7772020-10-27T06:22:00Z http://eprints.unisza.edu.my/777/ An efficient approach for traveling salesman problem solution with branch-and-bound Mustafa, Mamat Suyudi, M. Sukono, . QA75 Electronic computers. Computer science T Technology (General) 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. 2016 Conference or Workshop Item NonPeerReviewed image en http://eprints.unisza.edu.my/777/1/FH03-FIK-17-09078.jpg 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.
institution Universiti Sultan Zainal Abidin
building UNISZA Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Sultan Zainal Abidin
content_source UNISZA Institutional Repository
url_provider https://eprints.unisza.edu.my/
language English
topic QA75 Electronic computers. Computer science
T Technology (General)
spellingShingle QA75 Electronic computers. Computer science
T Technology (General)
Mustafa, Mamat
Suyudi, M.
Sukono, .
An efficient approach for traveling salesman problem solution with branch-and-bound
description 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.
format Conference or Workshop Item
author Mustafa, Mamat
Suyudi, M.
Sukono, .
author_facet Mustafa, Mamat
Suyudi, M.
Sukono, .
author_sort Mustafa, Mamat
title An efficient approach for traveling salesman problem solution with branch-and-bound
title_short An efficient approach for traveling salesman problem solution with branch-and-bound
title_full An efficient approach for traveling salesman problem solution with branch-and-bound
title_fullStr An efficient approach for traveling salesman problem solution with branch-and-bound
title_full_unstemmed An efficient approach for traveling salesman problem solution with branch-and-bound
title_sort efficient approach for traveling salesman problem solution with branch-and-bound
publishDate 2016
url http://eprints.unisza.edu.my/777/1/FH03-FIK-17-09078.jpg
http://eprints.unisza.edu.my/777/
_version_ 1683234928499621888
score 13.209306

Similar Items