BaseMax/01Knapsack
View on GitHubThe project focuses on solving the 0/1 Knapsack problem using various algorithms. The 0/1 Knapsack problem is a well-known optimization problem in computer science that deals with finding the best combination of items to pack into a knapsack, where each item has a weight and a value, and the knapsack has a limited capacity.
- Stars
- 1
- Forks
- 0
- Open beginner issues
- 0
- Indexed issues
- 1
- Dominant language
- Python
- License
- GPL-3.0
- Last GitHub push
- Feb 5, 2023
- Latest indexed
- Sep 14, 2026
- Contributing guide
- No contributing guide
- Code of conduct
- No code of conduct
- Beginner labels
- good first issue help wanted
- PR merge metrics
- No merged PRs in 30d
-
Mistakes Openbug enhancement good first issue help wanted question
BaseMax/01Knapsack#1 · 3 comments · 0 reactions · 0 assignees ·