@article{An_2017, place={Dalat, Vietnam}, title={APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP}, volume={7}, url={https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/239}, DOI={10.37569/DalatUniversity.7.2.239(2017)}, abstractNote={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.}, number={2}, journal={Dalat University Journal of Science}, author={An, Đỗ Như}, year={2017}, month={Jun.}, pages={205–216} }