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...
Saved in:
| 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832570573523255296 |
|---|---|
| author | Đỗ Như An |
| author_facet | Đỗ Như An |
| author_sort | Đỗ Như An |
| collection | DOAJ |
| description | 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 the combinatorial optimization problems related to the Hamiltonian cycle based on the TSP. |
| format | Article |
| id | doaj-art-8a9da8f1a7344be8b527c1ce1cb926a4 |
| institution | Kabale University |
| issn | 0866-787X 0866-787X |
| language | English |
| publishDate | 2017-06-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-8a9da8f1a7344be8b527c1ce1cb926a42025-02-02T14:51:05ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X0866-787X2017-06-017220521610.37569/DalatUniversity.7.2.239(2017)134APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSPĐỗ Như An0Khoa Công nghệ Thông tin, Trường Đại học Nha TrangThe 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 the combinatorial optimization problems related to the Hamiltonian cycle based on the TSP.http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/239bài toán người du lịchbài toán tối ưu tổ hợpchu trình hamiltonđường hamiltonnp-đầy đủnp-khóthuật toán nhánh-cận. |
| spellingShingle | Đỗ Như An APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP Tạp chí Khoa học Đại học Đà Lạt bài toán người du lịch bài toán tối ưu tổ hợp chu trình hamilton đường hamilton np-đầy đủ np-khó thuật toán nhánh-cận. |
| title | APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP |
| title_full | APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP |
| title_fullStr | APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP |
| title_full_unstemmed | APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP |
| title_short | APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP |
| title_sort | applications of branch bound algorithm to solve some optimal problems related to the hamiltonian cycle based on the tsp |
| topic | bài toán người du lịch bài toán tối ưu tổ hợp chu trình hamilton đường hamilton np-đầy đủ np-khó thuật toán nhánh-cận. |
| url | http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/239 |
| work_keys_str_mv | AT đonhuan applicationsofbranchboundalgorithmtosolvesomeoptimalproblemsrelatedtothehamiltoniancyclebasedonthetsp |