{"id":25526313,"url":"https://github.com/davide64-dev/feup_da_tsp","last_synced_at":"2025-07-17T14:35:41.238Z","repository":{"id":244288338,"uuid":"814806975","full_name":"Davide64-dev/FEUP_DA_TSP","owner":"Davide64-dev","description":"🗺️ | Investigating TSP using various algorithms and approximation methods","archived":false,"fork":false,"pushed_at":"2024-06-13T19:02:07.000Z","size":632,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-06-14T21:50:51.419Z","etag":null,"topics":["approximation","backtracking","da","feup","heuristics","travelling-salesman-problem","tsp"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Davide64-dev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-06-13T18:41:06.000Z","updated_at":"2024-06-13T19:02:10.000Z","dependencies_parsed_at":"2024-06-13T21:48:14.746Z","dependency_job_id":"159775a9-9d6b-47e1-aee1-de5e683501c0","html_url":"https://github.com/Davide64-dev/FEUP_DA_TSP","commit_stats":null,"previous_names":["davide64-dev/feup_da_tsp"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Davide64-dev%2FFEUP_DA_TSP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Davide64-dev%2FFEUP_DA_TSP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Davide64-dev%2FFEUP_DA_TSP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Davide64-dev%2FFEUP_DA_TSP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Davide64-dev","download_url":"https://codeload.github.com/Davide64-dev/FEUP_DA_TSP/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239735249,"owners_count":19688262,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["approximation","backtracking","da","feup","heuristics","travelling-salesman-problem","tsp"],"created_at":"2025-02-19T21:17:23.581Z","updated_at":"2025-02-19T21:17:24.114Z","avatar_url":"https://github.com/Davide64-dev.png","language":"C++","readme":"# Design of Algorithms 2023/2024\n\nThis repository has the exploration of the Traveling Salesman Problem (TSP) using various algorithms and approximation techniques implemented in C++.\n\nThe 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.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdavide64-dev%2Ffeup_da_tsp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdavide64-dev%2Ffeup_da_tsp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdavide64-dev%2Ffeup_da_tsp/lists"}