{"id":44947766,"url":"https://github.com/phoenixsmaug/tsp","last_synced_at":"2026-02-18T10:01:03.909Z","repository":{"id":290511348,"uuid":"972633606","full_name":"PhoenixSmaug/TSP","owner":"PhoenixSmaug","description":"A comparison of various solvers for the Travelling Salesman Problem.","archived":false,"fork":false,"pushed_at":"2026-01-26T13:42:00.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-27T02:56:27.223Z","etag":null,"topics":["backtracking","branch-and-bound","integer-programming","tsp","tsp-solver"],"latest_commit_sha":null,"homepage":"","language":"Julia","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/PhoenixSmaug.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"zenodo":null}},"created_at":"2025-04-25T11:59:25.000Z","updated_at":"2026-01-26T13:42:03.000Z","dependencies_parsed_at":"2025-04-29T08:02:02.815Z","dependency_job_id":"e9ac5796-f658-49b6-a9e3-3e86d5f82bbf","html_url":"https://github.com/PhoenixSmaug/TSP","commit_stats":null,"previous_names":["phoenixsmaug/tsp"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/PhoenixSmaug/TSP","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PhoenixSmaug%2FTSP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PhoenixSmaug%2FTSP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PhoenixSmaug%2FTSP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PhoenixSmaug%2FTSP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/PhoenixSmaug","download_url":"https://codeload.github.com/PhoenixSmaug/TSP/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PhoenixSmaug%2FTSP/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29575343,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-18T08:38:15.585Z","status":"ssl_error","status_checked_at":"2026-02-18T08:38:14.917Z","response_time":162,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["backtracking","branch-and-bound","integer-programming","tsp","tsp-solver"],"created_at":"2026-02-18T10:00:51.940Z","updated_at":"2026-02-18T10:01:03.880Z","avatar_url":"https://github.com/PhoenixSmaug.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Various solvers for the Travelling Salesman Problem\n\nThe [Travelling Salesman Problem (TSP)](https://en.m.wikipedia.org/wiki/Travelling_salesman_problem) is a famously hard combinatorial optimization problem. Here two solvers are implemented:\n\n* An efficient solver, which uses the [Miller-Tucker-Zemlin Encoding](https://phabe.ch/2021/09/19/tsp-subtour-elimination-by-miller-tucker-zemlin-constraint/) to translate TSP into an Integer Programming problem and solves that with the commercial state-of-the-art solver Gurobi\n* A standalone solver which implements the [Held-Karp algorithm](https://en.wikipedia.org/wiki/Held%E2%80%93Karp_algorithm) to solve TSP with dynamic programming\n* A simple branch-and-bound solver for educational purposes, who can prune backtracking branches as soon as their lower bound is bigger than the current maximum\n\nUsing `benchmark()`, one can compare the performances on the [TSPLIB95 Dataset](http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/). `benchmark.log` also provides pre-recorded results measured with an Intel i9-10980HK and 32 GB of memory.\n\n(c) Mia Müßig","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphoenixsmaug%2Ftsp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fphoenixsmaug%2Ftsp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphoenixsmaug%2Ftsp/lists"}