e-candeloro / modified-tsp-optimization Goto Github PK
View Code? Open in Web Editor NEWA 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)