Skip to content

Latest commit

 

History

History
24 lines (17 loc) · 1.38 KB

README.md

File metadata and controls

24 lines (17 loc) · 1.38 KB

Travelling Salesman Problem

School project wich aims to implement different types of algorithm in order to solve the Travelling Salesman Problem. It also includes performance analysis in report.

For more informations, please read the subject and the report. You can also read the GRASP document for more information.

A README is available in each algorithm source folder. Click on the links below for direct access:

Algorithms Summary

Authors

  • maximenrb
  • Eléna Commereuc
  • Léo Pinneau
  • Tanguy Morinière

License

This project is licensed under the GNU General Public License v3.0

See the LICENSE file for details