{"id":26920912,"url":"https://github.com/renatomaynard/branch-and-bound-for-multiple-knapsack-problem","last_synced_at":"2025-04-01T22:49:17.493Z","repository":{"id":285377333,"uuid":"948774479","full_name":"RenatoMaynard/Branch-and-Bound-for-Multiple-Knapsack-Problem","owner":"RenatoMaynard","description":"A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.","archived":false,"fork":false,"pushed_at":"2025-03-15T00:37:57.000Z","size":25,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-31T12:01:39.886Z","etag":null,"topics":["branch-and-bound","combinatorial-optimization","heuristic-algorithms","knapsack-problem","multiple-knapsack-problem","np-hard","operations-research","optimization-algorithms","python","quadratic-knapsack"],"latest_commit_sha":null,"homepage":"","language":"Python","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/RenatoMaynard.png","metadata":{},"created_at":"2025-03-14T23:56:32.000Z","updated_at":"2025-03-30T21:42:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"f8170702-38cc-49f1-9f93-1239ee2d84ba","html_url":"https://github.com/RenatoMaynard/Branch-and-Bound-for-Multiple-Knapsack-Problem","commit_stats":null,"previous_names":["renatomaynard/branch-and-bound-for-multiple-knapsack-problem"],"tags_count":null,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RenatoMaynard%2FBranch-and-Bound-for-Multiple-Knapsack-Problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RenatoMaynard%2FBranch-and-Bound-for-Multiple-Knapsack-Problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RenatoMaynard%2FBranch-and-Bound-for-Multiple-Knapsack-Problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RenatoMaynard%2FBranch-and-Bound-for-Multiple-Knapsack-Problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RenatoMaynard","download_url":"https://codeload.github.com/RenatoMaynard/Branch-and-Bound-for-Multiple-Knapsack-Problem/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246724801,"owners_count":20823544,"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":["branch-and-bound","combinatorial-optimization","heuristic-algorithms","knapsack-problem","multiple-knapsack-problem","np-hard","operations-research","optimization-algorithms","python","quadratic-knapsack"],"created_at":"2025-04-01T22:49:16.984Z","updated_at":"2025-04-01T22:49:17.472Z","avatar_url":"https://github.com/RenatoMaynard.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frenatomaynard%2Fbranch-and-bound-for-multiple-knapsack-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frenatomaynard%2Fbranch-and-bound-for-multiple-knapsack-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frenatomaynard%2Fbranch-and-bound-for-multiple-knapsack-problem/lists"}