https://github.com/davide64-dev/feup_da_tsp

🗺️ | Investigating TSP using various algorithms and approximation methods
https://github.com/davide64-dev/feup_da_tsp

approximation backtracking da feup heuristics travelling-salesman-problem tsp

Last synced: 3 months ago
JSON representation

🗺️ | Investigating TSP using various algorithms and approximation methods

• Host: GitHub
• URL: https://github.com/davide64-dev/feup_da_tsp
• Owner: Davide64-dev
• Created: 2024-06-13T18:41:06.000Z (over 1 year ago)
• Default Branch: master
• Last Pushed: 2024-06-13T19:02:07.000Z (over 1 year ago)
• Last Synced: 2024-06-14T21:50:51.419Z (over 1 year ago)
• Topics: approximation, backtracking, da, feup, heuristics, travelling-salesman-problem, tsp
• Language: C++
• Homepage:
• Size: 617 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Design of Algorithms 2023/2024

This repository has the exploration of the Traveling Salesman Problem (TSP) using various algorithms and approximation techniques implemented in C++.

The creation of this program is part of the curriculum for the [Algorithm Design](https://sigarra.up.pt/feup/en/ucurr_geral.ficha_uc_view?pv_ocorrencia_id=520321) course.