บทความวิจัยพ.ศ. 2560
?NG D?NG THU?T TO?N NH?NH C?N ?? GI?I M?T S? B?I TO?N T?I ?U LI?N QUAN ??N CHU TR?NH HAMILTON D?A TR?N B?I TO?N TSP
พ.ศ. 2560
คำสำคัญ
Combinatorial optimization problemNP-HardHamiltonian cycleB?i to?n ng??i du l?chB?i to?n t?i ?u t? h?pBranch-bound algorithmChu tr?nh Hamilton???ng HamiltonNP-C (Non-deterministic Polynomial CompleteNP-kh?NP-??y ??Thu?t to?n nh?nh-c?n.Traveling Salesman Problem (TSP).