This is a rewrite in rust of the work done by the students:
in the discipline of "Projeto e Análise de Algoritmos", 5th period of Computer Science at PUC MG.
You can find the original work in c++ here
The objective of the work is the study and the implementation of algorithms to solve the Traveling Salesman Problem using the following paradigms:
- Brute force
- Branch and bound
- Dynamic programming
- Genetic algorithm