{"id":23894362,"url":"https://github.com/princep/orlin","last_synced_at":"2026-06-22T14:31:46.089Z","repository":{"id":88666294,"uuid":"80992564","full_name":"PrinceP/Orlin","owner":"PrinceP","description":"Basic Implementation of Orlin and iwata algorithm windows","archived":false,"fork":false,"pushed_at":"2017-03-28T07:47:07.000Z","size":35648,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-23T06:29:10.712Z","etag":null,"topics":["cplusplus-14","optimization","optimization-algorithms"],"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/PrinceP.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":"2017-02-05T12:52:36.000Z","updated_at":"2019-11-13T00:50:31.000Z","dependencies_parsed_at":"2023-03-13T18:19:41.314Z","dependency_job_id":null,"html_url":"https://github.com/PrinceP/Orlin","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/PrinceP/Orlin","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PrinceP%2FOrlin","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PrinceP%2FOrlin/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PrinceP%2FOrlin/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PrinceP%2FOrlin/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/PrinceP","download_url":"https://codeload.github.com/PrinceP/Orlin/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PrinceP%2FOrlin/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34653712,"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-06-22T02:00:06.391Z","response_time":106,"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":["cplusplus-14","optimization","optimization-algorithms"],"created_at":"2025-01-04T14:57:15.672Z","updated_at":"2026-06-22T14:31:46.084Z","avatar_url":"https://github.com/PrinceP.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Orlin\nBasic Implementation of Orlin and iwata algorithm\n\n\n# Logs\n\n1. Submodular set function implemented - |X||V-X| + f'(X)\n2. Generic framework - implemented.\n3. Distance label -implemented. \n\n# Todos \n\n1. Bug in push procedure. This step updates x by adding one linear order L2 and possibly removing one linear order L1 from set.\n\n[-10.819, -16.1362, -223.986, 8.0142, -1.9621]\nSet [] = 4\nSet [1] = -4.819\nSet [2] = -10.1362\nSet [1, 2] = -20.9552\nSet [3] = -217.986\nSet [1, 3] = -228.805\nSet [2, 3] = -234.122\nSet [1, 2, 3] = -246.941\nSet [4] = 14.0142\nSet [1, 4] = 3.1952\nSet [2, 4] = -2.122\nSet [1, 2, 4] = -14.941\nSet [3, 4] = -209.972\nSet [1, 3, 4] = -222.791\nSet [2, 3, 4] = -228.108\nSet [1, 2, 3, 4] = -242.927\nSet [5] = 4.0379\nSet [1, 5] = -6.7811\nSet [2, 5] = -12.0983\nSet [1, 2, 5] = -24.9173\nSet [3, 5] = -219.948\nSet [1, 3, 5] = -232.767\nSet [2, 3, 5] = -238.084\nSet [1, 2, 3, 5] = -252.903\nSet [4, 5] = 12.0521\nSet [1, 4, 5] = -0.7669\nSet [2, 4, 5] = -6.0841\nSet [1, 2, 4, 5] = -20.9031\nSet [3, 4, 5] = -213.934\nSet [1, 3, 4, 5] = -228.753\nSet [2, 3, 4, 5] = -234.07\nSet [1, 2, 3, 4, 5] = -250.889\n\n\n\n2. Finding the gap. \n\n\n# References\n\n[Orlin Iwata Lecture](http://people.math.gatech.edu/~tetali/LINKS/IWATA/SFM.pdf)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprincep%2Forlin","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fprincep%2Forlin","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprincep%2Forlin/lists"}