[1]
“Analysis of Brute Force and Branch & Bound Algorithms to solve the Traveling Salesperson Problem (TSP)”, TURCOMAT, vol. 12, no. 8, pp. 1226–1229, Apr. 2021, Accessed: May 30, 2026. [Online]. Available: https://www.turcomat.org/index.php/turkbilmat/article/view/3031