{"id":19884528,"url":"https://github.com/ahmetcerol/knapsack-problem","last_synced_at":"2026-06-03T20:31:30.663Z","repository":{"id":188882930,"uuid":"649642495","full_name":"ahmetcerol/Knapsack-Problem","owner":"ahmetcerol","description":"Solving Knapsack Problem","archived":false,"fork":false,"pushed_at":"2023-10-20T11:50:16.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-01T03:42:26.958Z","etag":null,"topics":["artificialbeecolony","bruteforce","dynamic-programming","knapsack-problem","knapsack-solver","python","value-weights"],"latest_commit_sha":null,"homepage":"","language":"Python","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/ahmetcerol.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":"2023-06-05T10:20:30.000Z","updated_at":"2023-10-20T11:51:44.000Z","dependencies_parsed_at":"2025-01-11T18:32:54.294Z","dependency_job_id":"f0e87891-d400-43f1-840c-b499883f6790","html_url":"https://github.com/ahmetcerol/Knapsack-Problem","commit_stats":null,"previous_names":["ahmetcerol/knapsack-problem"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ahmetcerol/Knapsack-Problem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmetcerol%2FKnapsack-Problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmetcerol%2FKnapsack-Problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmetcerol%2FKnapsack-Problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmetcerol%2FKnapsack-Problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ahmetcerol","download_url":"https://codeload.github.com/ahmetcerol/Knapsack-Problem/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmetcerol%2FKnapsack-Problem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33878990,"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-03T02:00:06.370Z","response_time":59,"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":["artificialbeecolony","bruteforce","dynamic-programming","knapsack-problem","knapsack-solver","python","value-weights"],"created_at":"2024-11-12T17:27:38.676Z","updated_at":"2026-06-03T20:31:30.647Z","avatar_url":"https://github.com/ahmetcerol.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Knapsack-Problem\n#### Ahmet Can Erol\n\n*Bu algoritma Knapsack Problemi diye adlandırdığımız problemin çözümünü ve örnek verilerini içermektedir.*\n*Knapsack problemini farklı yöntemlerle farklı şekillerde çözerek sonuçlarını karşılaştırdığımız bu projede; Yapay Arı kolonisi ,brutefore ve value-weight algoritmaları üzerinden çözümler gerçekleştirilmiştir.*\n\n## English\n\n*This algorithm include solving Knapsack Problem*\n*In this project, we have tackled the Knapsack problem using various methods, namely the Artificial Bee Colony, Brute Force,Dynamic and Value-Weight algorithms, and compared the results obtained from each approach*\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fahmetcerol%2Fknapsack-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fahmetcerol%2Fknapsack-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fahmetcerol%2Fknapsack-problem/lists"}