{"id":16684267,"url":"https://github.com/aligusnet/optimer","last_synced_at":"2026-04-27T14:32:07.436Z","repository":{"id":137799856,"uuid":"78612386","full_name":"aligusnet/optimer","owner":"aligusnet","description":"Discrete optimization library","archived":false,"fork":false,"pushed_at":"2021-02-13T17:53:15.000Z","size":1516,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-12-31T00:34:56.864Z","etag":null,"topics":["discrete-optimization","traveling-salesman"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aligusnet.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}},"created_at":"2017-01-11T07:08:35.000Z","updated_at":"2021-02-13T17:53:18.000Z","dependencies_parsed_at":"2023-05-22T14:15:15.927Z","dependency_job_id":null,"html_url":"https://github.com/aligusnet/optimer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aligusnet/optimer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aligusnet%2Foptimer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aligusnet%2Foptimer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aligusnet%2Foptimer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aligusnet%2Foptimer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aligusnet","download_url":"https://codeload.github.com/aligusnet/optimer/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aligusnet%2Foptimer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32341447,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-26T23:26:28.701Z","status":"online","status_checked_at":"2026-04-27T02:00:06.769Z","response_time":128,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["discrete-optimization","traveling-salesman"],"created_at":"2024-10-12T14:42:54.637Z","updated_at":"2026-04-27T14:32:07.417Z","avatar_url":"https://github.com/aligusnet.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Optimer\n## Discrete Optimization Library\n## Performace testing\n\n\nThe results of the reference implementation are presented in the third column \"time (s.)\". Results of other implementations are presented in columns with names \"(n)\", where n is a reference number of the implementation. Please see below the table to get the full list of the implementations.\n\n\n| Problem | # of cities | time (s.) | # of cores |  (1) | (2) | (3) | (3) - Concorde | (4) | (5) |\n| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |\n| br17 | 17 | 2.891 | 8 | 3 | 4.18 | -- | -- | 6.937 | 1256.524 |\n| ft53 | 53 | 57.136 | 8 | -- | 2.53 | 0.44 | 0.27 | -- | -- |\n| ft70 | 70 | 0.078 | 2 | -- | 1.87 | 1.51 | -- | -- | 147.265 |\n| ftv33 | 34 | 0.004 | 4 | -- | 0.11 | 0.01 | -- | 3.94 | 0.156 |\n| ftv35 | 36 | 0.007 | 8 | -- | 0.22 | 0.46 | -- | 97.425 | 0.031 |\n| ftv38 | 39 | 0.012 | 8 | -- | 0.22 | 0.51 | -- | 382.958 | 0.031 |\n| ftv44 | 45 | 0.008 | 4 | -- | 0.05 | 0.06 | -- | -- | 0.078 |\n| ftv47 | 48 | 0.041 | 8 | -- | 1.37 | 2.07 | -- | -- | 0.406 |\n| ftv55 | 56 | 0.347 | 8 | 6 | 4.56 | 10.59 | -- | -- | 2.437 |\n| ftv64 | 65 | 0.191 | 8 | -- | 3.24 | 1.56 | 30.21 | -- | 1.984 |\n| ftv70 | 71 | 0.301 | 8 | 9 | 8.57 | 4.89 | 8.43 | -- | 8.203 |\n| ftv90 | 91 | 0.077 | 8 | -- | 1.54 | -- | -- | -- | 1.484 |\n| ftv100 | 101 | 0.975 | 8 | -- | 21.87 | -- | -- | -- | -- |\n| ftv110 | 111 | 1.291 | 8 | -- | 89.56 | -- | -- | -- | -- |\n| ftv120 | 121 | 8.453 | 8 | -- | 305.71 | -- | -- | -- | -- |\n| ftv130 | 131 | 0.421 | 8 | -- | 19.01 | -- | -- | -- | 114.265 |\n| ftv140 | 141 | 0.756 | 8 | -- | 13.3 | -- | -- | -- | 108.375 |\n| ftv150 | 151 | 0.402 | 8 | -- | 4.67 | -- | -- | -- | 132.078 |\n| ftv160 | 161 | 8.328 | 8 | -- | 496.92 | -- | -- | -- | 3771.093 |\n| ftv170 | 171 | 39.827 | 8 | 480 | 656.59 | -- | -- | -- | -- |\n| kro124p | 100 | 219.555 | 8 | -- | Not | 1000+ | 5.61 | -- | 3505.406 |\n| rbg323 | 323 | 0.306 | 2 | -- | 0 | -- | -- | 0.034 | 2.968 |\n| rbg358 | 358 | 0.393 | 2 | -- | 0 | 0.03 | -- | 0.042 | 7.328 |\n| rbg403 | 403 | 0.602 | 2 | -- | 0.05 | -- | 847.1 | 0.079 | 5.484 |\n| rbg443 | 443 | 0.734 | 2 | -- | 0.05 | 0.05 | 81.62 | 0.079 | 3.578 |\n| ry48p | 48 | 15.908 | 8 | -- | 105.88 | 77.35 | 11.39 | -- | 54.406 |\n| p43 | 43 | 2280* | 8 | 4800 | Not | -- | -- | -- | -- |\n\n\n\n1. AV Tyulenev, Application of integer linear programming with sequential elimination of cycles to solve the traveling salesman problem. 2012\n2. Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma. Tolerance-based Branch and Bound algorithms for the ATSP. 2008.\t\t\t\t\t\t\t\n3. Remco Germs, Boris Goldengorin, Marcel Turkenstee. Lower tolerance-based Branch and Bound algorithms for the ATSP. 2012\t\t\t\t\t\t\t\n4. Pessoa, Tiago Carneiro. Estratégias paralelas inteligentes para o método branch-and-\nbound aplicadas ao problema do caixeiro viajante assimétrico. 2012.\t\t\t\t\t\t\t\n5. IF Borhanov, VR Fazylov, \"Little's method with optimal matrix reduction\", Physics and mathematics, Cat. App. Kazan. State. University. Ser. Phys.-Math. Science, 148, No. 4, Kazan Univ., Kazan, 2006, 13-22\n\n\n### Build instruction\n\n```\n% mdkir build\n% cd build\n% export CXX=clang++ # or another compiler that you wish to use\n% cmake ..\n% make\n% make test   # run unit tests\n% cd ../  # back to the project's root dir\n% ./build/atsp config/default.ini\n% cmake -DCMAKE_BUILD_TYPE=Release .. # to build release version\n```\n\n### Build instruction for Visual Studio 2012 (by Alexey Voytenko)\n\n```\n% mkdir build\n% cd build\n% cmake -DUSE_UNIT_TESTS=OFF ..\n```\n\n*unit tests are not supported for VS now*\n\n### Known issues \n\n* MacPorts clang-3.3: http://trac.macports.org/ticket/38527\nto fix it just add a line to `~/.profile`:\n  \n  `export DYLD_LIBRARY_PATH=$DYLD_LIBRARY_PATH:/opt/local/libexec/llvm-3.3/lib/clang/3.3/lib/darwin`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faligusnet%2Foptimer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faligusnet%2Foptimer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faligusnet%2Foptimer/lists"}