Solve traveling salesman problem (TSP) using branch and bound or brute force.
Primary LanguageJupyter NotebookMIT LicenseMIT