Analysis of Brute Force and Branch & Bound Algorithms to solve the Traveling Salesperson Problem (TSP). (2021). Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(8), 1226-1229. https://turcomat.org/index.php/turkbilmat/article/view/3031