Add your perspective Generally, you can use the known techniques as divide-and conquer's, greedy's or dynamic programming. Recognize also if it is a NP-hard problem.

This project investigates Python to study the Traveling Salesman Problem (TSP) and looks at five different algorithms that can be implemented: Brute Force, Greedy, Genetic, Dynamic Programming, and ...