{"id":22828568,"url":"https://github.com/sandyspiers/coordinate_partitioning","last_synced_at":"2025-03-31T01:17:22.016Z","repository":{"id":194012177,"uuid":"689918062","full_name":"sandyspiers/coordinate_partitioning","owner":"sandyspiers","description":"An exact algorithm for difficulty and high coordinate Euclidean diversity problems","archived":false,"fork":false,"pushed_at":"2025-01-23T23:32:11.000Z","size":6726,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-06T06:34:15.233Z","etag":null,"topics":["optimisation-algorithms","paper","quadratic-programming"],"latest_commit_sha":null,"homepage":"https://doi.org/10.1287/opre.2023.0612","language":"Jupyter Notebook","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/sandyspiers.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":"2023-09-11T07:18:03.000Z","updated_at":"2025-01-23T23:32:22.000Z","dependencies_parsed_at":"2024-07-22T07:29:04.848Z","dependency_job_id":"788b7e65-ede9-483d-98e3-d8060ae98c3d","html_url":"https://github.com/sandyspiers/coordinate_partitioning","commit_stats":null,"previous_names":["sandyspiers/coordinate_partitioning"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyspiers%2Fcoordinate_partitioning","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyspiers%2Fcoordinate_partitioning/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyspiers%2Fcoordinate_partitioning/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyspiers%2Fcoordinate_partitioning/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sandyspiers","download_url":"https://codeload.github.com/sandyspiers/coordinate_partitioning/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246399803,"owners_count":20770909,"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":["optimisation-algorithms","paper","quadratic-programming"],"created_at":"2024-12-12T19:10:34.844Z","updated_at":"2025-03-31T01:17:21.953Z","avatar_url":"https://github.com/sandyspiers.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems\n\nThis repo contains a new exact method to solve difficult and high-coordinate Euclidean max-sum diversity problems.\nIt is associated with [1], and comes as a result of our work in [2].\n\n## Dependencies\n\n* `Cplex 22.1.1`\n* `Eigen 3.4.0`\n\n## Reproducibility\n\nTo reproduce the results in [1], update `CMakeLists.txt` to include corrected filepaths for `Cplex` and `Eigen` libraries and run\n\n```bash\nmkdir build\ncd build\ncmake ..\nmake .\n```\n\nThen to run the experiments in the background, run\n\n```bash\nnohup ./build/coordinate_partitioning \u0026\n```\n\n## References\n\n[1] [Spiers, S., Bui, H. T., \u0026 Loxton, R. (2023). Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems. *Operations Research*.](https://doi.org/10.1287/opre.2023.0612)\n\n[2] [Spiers, S., Bui, H. T., \u0026 Loxton, R. (2023). An exact cutting plane method for the Euclidean max-sum diversity problem. *European Journal of Operational Research*.](https://www.sciencedirect.com/science/article/pii/S037722172300379X).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsandyspiers%2Fcoordinate_partitioning","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsandyspiers%2Fcoordinate_partitioning","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsandyspiers%2Fcoordinate_partitioning/lists"}