{"id":20143958,"url":"https://github.com/erykmika/atsp-pea","last_synced_at":"2026-03-05T16:08:01.793Z","repository":{"id":220727197,"uuid":"704026196","full_name":"erykmika/ATSP-PEA","owner":"erykmika","description":"Traveling Salesman Problem","archived":false,"fork":false,"pushed_at":"2024-01-26T16:29:56.000Z","size":14349,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-13T10:49:57.294Z","etag":null,"topics":["politechnikawroclawska","pwr","tsp","tsp-problem","university-coursework","university-project"],"latest_commit_sha":null,"homepage":"","language":null,"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/erykmika.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}},"created_at":"2023-10-12T11:41:43.000Z","updated_at":"2024-02-25T16:18:07.000Z","dependencies_parsed_at":"2024-02-03T22:29:32.335Z","dependency_job_id":"b7879178-fd83-4a04-bf26-046054e93e53","html_url":"https://github.com/erykmika/ATSP-PEA","commit_stats":null,"previous_names":["erykmika/atsp-pea"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/erykmika%2FATSP-PEA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/erykmika%2FATSP-PEA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/erykmika%2FATSP-PEA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/erykmika%2FATSP-PEA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/erykmika","download_url":"https://codeload.github.com/erykmika/ATSP-PEA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241587912,"owners_count":19986627,"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":["politechnikawroclawska","pwr","tsp","tsp-problem","university-coursework","university-project"],"created_at":"2024-11-13T22:08:13.227Z","updated_at":"2026-03-05T16:08:01.737Z","avatar_url":"https://github.com/erykmika.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# PEA-PWr\n\n## The Traveling Salesman Problem\n\nSolutions using different methods are presented.   \nRozwiązania przy wykorzystaniu różnych metod.\n\n|      **Branch**    |            **Project**             | \n|------------------- |------------------------------------|\n|        P1          |  Brute-force method                | \n|        P2          |  Branch-and-bound method           |\n|        P3          |  Simulated Annealing \u0026 Tabu Search |\n|        P4          |  Genetic Algorithm                 |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ferykmika%2Fatsp-pea","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ferykmika%2Fatsp-pea","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ferykmika%2Fatsp-pea/lists"}