/Modified-TSP-Optimization

A modified Traveling Salesman Problem (TSP) optimization where a directed graph tour starting and ending at the first node is chosen so to maximize a custom objective function (net profit)

Primary LanguageJupyter Notebook

No issues in this repository yet.