A Lesson in Algorithms and Data Structures: the Traveling Salesman

from blog nickb.dev, | ↗ original
Recently in an EECS course we were asked to solve the Traveling Salesman problem using Manhattan Distances. I will give a general overview to how I solved this problem, so a basic understanding of the concept is necessary. Approximation Before computing the actual Hamiltonian circuit that will satisfy the problem, it is best to approximate how...