{"id":29698838,"url":"https://github.com/wollac/ubahn","last_synced_at":"2026-07-03T17:34:19.837Z","repository":{"id":71553099,"uuid":"92217488","full_name":"Wollac/ubahn","owner":"Wollac","description":"Rapid Transit Challenge solver","archived":false,"fork":false,"pushed_at":"2017-05-23T20:58:54.000Z","size":40,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-30T02:50:51.798Z","etag":null,"topics":["graph-algorithms","integer-programming"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Wollac.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":"2017-05-23T20:33:38.000Z","updated_at":"2019-03-24T18:49:29.000Z","dependencies_parsed_at":null,"dependency_job_id":"fdf6dfa9-ef82-4d82-ab80-b0ee277f3a90","html_url":"https://github.com/Wollac/ubahn","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Wollac/ubahn","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Wollac%2Fubahn","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Wollac%2Fubahn/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Wollac%2Fubahn/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Wollac%2Fubahn/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Wollac","download_url":"https://codeload.github.com/Wollac/ubahn/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Wollac%2Fubahn/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35096008,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-03T02:00:05.635Z","response_time":110,"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":["graph-algorithms","integer-programming"],"created_at":"2025-07-23T10:39:19.876Z","updated_at":"2026-07-03T17:34:19.832Z","avatar_url":"https://github.com/Wollac.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ubahn\n## Solver for the [Rapid Transit Challenge][1] problem\nThis program computes an optimal solution to the Rapid Transit Challenge - Class B, where the transportation network is given in a specific XML-format.\nA detailed description of the algorithm as well as the proof of correctness can be found in:\n\nWelz, Wolfgang A. \"Robot Tour Planning with High Determination Costs - Routing under Uncertainty.\" (2014). http://dx.doi.org/10.14279/depositonce-4300\n\n#### Requirements\n* IBM CPLEX and Concert\n* LEDA\n* Apache Xerces\n* Boost (C++ Libraries)\n\n[1]: http://www.rapidtransitchallenge.com/rules.htm\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwollac%2Fubahn","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwollac%2Fubahn","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwollac%2Fubahn/lists"}