| _version_ |
1860800047680061440
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2020-06-18 02:35:50
|
| eventvenue |
Park Hotel Congress Center PilsenPilsen; Czech Republic
|
| format |
Restricted Document
|
| id |
8435
|
| institution |
UniSZA
|
| originalfilename |
1836-01-FH03-FIK-20-38046.pdf
|
| person |
Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML
like Gecko) Chrome/81.0.4044.138 Safari/537.36
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8435
|
| spelling |
8435 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8435 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper application/pdf 3 1.6 Adobe Acrobat Pro DC 20 Paper Capture Plug-in Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML like Gecko) Chrome/81.0.4044.138 Safari/537.36 2020-06-18 02:35:50 1836-01-FH03-FIK-20-38046.pdf UniSZA Private Access Solving traveling salesman problems using branch and bound methods 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. 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019 Park Hotel Congress Center PilsenPilsen; Czech Republic
|
| spellingShingle |
Solving traveling salesman problems using branch and bound methods
|
| summary |
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.
|
| title |
Solving traveling salesman problems using branch and bound methods
|
| title_full |
Solving traveling salesman problems using branch and bound methods
|
| title_fullStr |
Solving traveling salesman problems using branch and bound methods
|
| title_full_unstemmed |
Solving traveling salesman problems using branch and bound methods
|
| title_short |
Solving traveling salesman problems using branch and bound methods
|
| title_sort |
solving traveling salesman problems using branch and bound methods
|