{"id":17810080,"url":"https://github.com/pwalig/ok_projekt","last_synced_at":"2026-01-20T07:08:18.272Z","repository":{"id":209720387,"uuid":"724791479","full_name":"pwalig/OK_Projekt","owner":"pwalig","description":"Solver for Multiple Knapsack Problem Variations","archived":false,"fork":false,"pushed_at":"2023-12-16T23:00:17.000Z","size":345,"stargazers_count":0,"open_issues_count":13,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-13T17:43:07.926Z","etag":null,"topics":["college-assignment","college-project","combinatorial-optimization","cplusplus","cpp","knapsack-problem","knapsack-problem-dynamic","knapsack-problem-greedy","knapsack-solver"],"latest_commit_sha":null,"homepage":"","language":"C++","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/pwalig.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-11-28T19:57:40.000Z","updated_at":"2024-04-18T21:28:23.000Z","dependencies_parsed_at":"2023-12-13T23:26:35.717Z","dependency_job_id":"8bfbcea6-07b9-452c-ae09-811dfd5dcf9a","html_url":"https://github.com/pwalig/OK_Projekt","commit_stats":null,"previous_names":["pwalig/ok_projekt"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pwalig%2FOK_Projekt","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pwalig%2FOK_Projekt/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pwalig%2FOK_Projekt/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pwalig%2FOK_Projekt/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pwalig","download_url":"https://codeload.github.com/pwalig/OK_Projekt/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247675610,"owners_count":20977378,"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":["college-assignment","college-project","combinatorial-optimization","cplusplus","cpp","knapsack-problem","knapsack-problem-dynamic","knapsack-problem-greedy","knapsack-solver"],"created_at":"2024-10-27T15:25:27.916Z","updated_at":"2026-01-20T07:08:18.267Z","avatar_url":"https://github.com/pwalig.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# OK_Projekt\nSolver for multiple Knapsack problem variants.\n\n\u003e [!WARNING]\n\u003e Project discontinued!\n\u003e \n\u003e See the successor: [graphsack](https://github.com/pwalig/graphsack)\n\n## Status\n\nProject discontinued in favour of [graphsack](https://github.com/pwalig/graphsack).\n\n### Done\n- Brute Force Methods\n- Primitive Branch and Bound Methods\n- Greedy algorithms\n- Dynamic Programming\n- measure calculation time\n- json format support\n- Heuristics\n\n### Missing\n- Multi threading\n- GPU support\n\n## Problems solved by OK_Project\n- Multi dimentional knapsack problem, but items are given as a graph, where each vertex in the graph is an item to pack. The problem is to find either path, cycle or tree in this graph, that fits in the knapsack and has maximum value.\n- [Knapsack Problem](https://en.wikipedia.org/wiki/Knapsack_problem)\n- [Multi Dimentional Knapsack Problem](https://en.wikipedia.org/wiki/Knapsack_problem#Multi-dimensional_knapsack_problem)\n\n## Using\n\nOK_Project uses:\n- C++ language\n- [nlohmann/json](https://github.com/nlohmann/json) JSON parser for Modern C++\n\n## Usage\n\nFor full usage and building instructions checkout [wiki](https://github.com/pwalig/OK_Projekt/wiki).\n\n## Building\n\n```\ngit clone https://github.com/pwalig/OK_Project.git\ncd OK_Project\ng++ -std=c++17 -g code/*cpp -o knapsack-solver.exe\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpwalig%2Fok_projekt","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpwalig%2Fok_projekt","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpwalig%2Fok_projekt/lists"}