{"id":13749049,"url":"https://github.com/rust-or/highs","last_synced_at":"2025-08-10T17:10:31.340Z","repository":{"id":54195508,"uuid":"342632760","full_name":"rust-or/highs","owner":"rust-or","description":"Safe rust bindings to the Highs MILP Solver.","archived":false,"fork":false,"pushed_at":"2025-07-25T12:44:10.000Z","size":66,"stargazers_count":24,"open_issues_count":5,"forks_count":15,"subscribers_count":7,"default_branch":"main","last_synced_at":"2025-08-10T02:51:43.790Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://crates.io/crates/highs","language":"Rust","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/rust-or.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":"2021-02-26T16:23:02.000Z","updated_at":"2025-07-25T12:44:03.000Z","dependencies_parsed_at":"2024-01-02T23:53:31.870Z","dependency_job_id":"cbd109a5-6e97-4fd8-8ea3-1c5f24d4754d","html_url":"https://github.com/rust-or/highs","commit_stats":{"total_commits":49,"total_committers":4,"mean_commits":12.25,"dds":"0.10204081632653061","last_synced_commit":"ee93e7c6591623a30b990f02ec7774157c5086e4"},"previous_names":[],"tags_count":23,"template":false,"template_full_name":null,"purl":"pkg:github/rust-or/highs","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rust-or%2Fhighs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rust-or%2Fhighs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rust-or%2Fhighs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rust-or%2Fhighs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rust-or","download_url":"https://codeload.github.com/rust-or/highs/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rust-or%2Fhighs/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269756394,"owners_count":24470566,"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","status":"online","status_checked_at":"2025-08-10T02:00:08.965Z","response_time":71,"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":[],"created_at":"2024-08-03T07:00:54.497Z","updated_at":"2025-08-10T17:10:31.305Z","avatar_url":"https://github.com/rust-or.png","language":"Rust","readme":"# highs\n\n[![highs docs badge](https://docs.rs/highs/badge.svg)](https://docs.rs/highs)\n\nSafe rust bindings to the Highs MILP Solver. Best used from the [**good_lp**](https://crates.io/crates/good_lp) linear\nprogramming modeler.\n\n## Usage examples\n\n#### Building a problem variable by variable\n\n```rust\nuse highs::{ColProblem, Sense};\n\nfn main() {\n    let mut pb = ColProblem::new();\n    // We cannot use more then 5 units of sugar in total.\n    let sugar = pb.add_row(..=5);\n    // We cannot use more then 3 units of milk in total.\n    let milk = pb.add_row(..=3);\n    // We have a first cake that we can sell for 2€. Baking it requires 1 unit of milk and 2 of sugar.\n    pb.add_integer_column(2., 0.., \u0026[(sugar, 2.), (milk, 1.)]);\n    // We have a second cake that we can sell for 8€. Baking it requires 2 units of milk and 3 of sugar.\n    pb.add_integer_column(8., 0.., \u0026[(sugar, 3.), (milk, 2.)]);\n    // Find the maximal possible profit\n    let solution = pb.optimise(Sense::Maximise).solve().get_solution();\n    // The solution is to bake one cake of each sort\n    assert_eq!(solution.columns(), vec![1., 1.]);\n}\n```\n\n#### Building a problem constraint by constraint\n\n```rust\nuse highs::*;\n\nfn main() {\n    let mut pb = RowProblem::new();\n    // Optimize 3x - 2y with x\u003c=6 and y\u003e=5\n    let x = pb.add_column(3., ..6);\n    let y = pb.add_column(-2., 5..);\n    pb.add_row(2.., \u0026[(x, 3.), (y, 8.)]); // 2 \u003c= x*3 + y*8\n}\n```\n","funding_links":[],"categories":["Projects"],"sub_categories":["Libraries"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frust-or%2Fhighs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frust-or%2Fhighs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frust-or%2Fhighs/lists"}