APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP
The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity. This paper presents how to use the branch-bound algorithm to solve some of...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2017-06-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/239 |