Description: Traveling Salesman Problem of a salesman to a number of cities to sell commodities, known distance between cities (or travel). Him to select a departure from the resident, through every city once again, and finally returned to the resident
- [Ant] - Ant colony algorithm to solve the optima
- [chepaishibie] - License Plate Recognition to develop sou
- [DP_TSP] - Dynamic Programming Code for the TSP
File list (Check if you may need any files):
Download