{"id":26917472,"url":"https://github.com/robertoaleman/ra-knapsack-problem-solver","last_synced_at":"2025-10-05T19:02:18.957Z","repository":{"id":285576696,"uuid":"958619555","full_name":"robertoaleman/RA-Knapsack-Problem-Solver","owner":"robertoaleman","description":"The 0/1 Knapsack problem involves selecting a subset of items, each with a weight and a value, to maximize the total value while staying within a given weight capacity. Each item can either be included or excluded (0 or 1).","archived":false,"fork":false,"pushed_at":"2025-04-01T14:04:26.000Z","size":0,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-01T14:42:18.605Z","etag":null,"topics":["algorithms","mathematical-methods","php"],"latest_commit_sha":null,"homepage":"https://ventics.com","language":"PHP","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/robertoaleman.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":"2025-04-01T13:46:22.000Z","updated_at":"2025-04-01T14:04:29.000Z","dependencies_parsed_at":"2025-04-01T14:42:21.040Z","dependency_job_id":"a2e4d267-43e4-4247-9e99-ceadf2ca1eae","html_url":"https://github.com/robertoaleman/RA-Knapsack-Problem-Solver","commit_stats":null,"previous_names":["robertoaleman/ra-knapsack-problem-solver"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robertoaleman%2FRA-Knapsack-Problem-Solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robertoaleman%2FRA-Knapsack-Problem-Solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robertoaleman%2FRA-Knapsack-Problem-Solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robertoaleman%2FRA-Knapsack-Problem-Solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/robertoaleman","download_url":"https://codeload.github.com/robertoaleman/RA-Knapsack-Problem-Solver/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246709913,"owners_count":20821297,"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":["algorithms","mathematical-methods","php"],"created_at":"2025-04-01T20:36:57.379Z","updated_at":"2025-10-05T19:02:18.902Z","avatar_url":"https://github.com/robertoaleman.png","language":"PHP","funding_links":[],"categories":[],"sub_categories":[],"readme":"# RA-Knapsack-Problem-Solver\n \u003cp\u003eAuthor: Roberto Aleman,\u003ca href=\"https://ventics.com/\"\u003eventics.com\u003c/a\u003e, license AGPL\u003c/p\u003e\n\n\u003ch3\u003eThe 0/1 Knapsack problem involves selecting a subset of items, each with a weight and a value, to maximize the total value while staying within a given weight capacity. Each item can either be included or excluded (0 or 1).\u003c/h3\u003e \n\n\u003cli\u003eIf you require further explanation, I can assist you based on my availability and at an hourly rate.\u003c/li\u003e\n\n\u003cli\u003eIf you need to implement this version or an advanced and/or customized version of my code in your system, I can assist you based on my availability and at an hourly rate.\u003c/li\u003e\n\n\u003cli\u003ePlease write to me and we'll discuss.\u003c/li\u003e\n\n\u003cli\u003eDo you need advice to implement an IT project, develop an algorithm to solve a real-world problem in your business, factory, or company?\nWrite me right now and I'll advise you.\u003c/li\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobertoaleman%2Fra-knapsack-problem-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frobertoaleman%2Fra-knapsack-problem-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobertoaleman%2Fra-knapsack-problem-solver/lists"}