| _version_ |
1860799629675724800
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2017-06-08 13:36:01
|
| eventvenue |
United States
|
| format |
Restricted Document
|
| id |
6762
|
| institution |
UniSZA
|
| originalfilename |
0777-01-FH03-FIK-17-09078.jpg
|
| person |
norman
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6762
|
| spelling |
6762 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6762 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 729 96 96 norman 2017-06-08 13:36:01 1438x729 1438 80 80 0777-01-FH03-FIK-17-09078.jpg UniSZA Private Access 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. Furthermore ,will be found to the tour cost is minimal between the city (node) connected. IEOM Detroit Conference, IEOM 2016 United States
|
| spellingShingle |
An efficient approach for traveling salesman problem solution with branch-and-bound
|
| summary |
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.
|
| title |
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_short |
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
|