⚠️ Warning: This is a draft ⚠️

This means it might contain formatting issues, incorrect code, conceptual problems, or other severe issues.

If you want to help to improve and eventually enable this page, please fork RosettaGit's repository and open a merge request on GitHub.

In a knapsack problem, the goal is to maximize some value subject to a set of constraints. Though the [[/Continuous|continuous case]] is very simple, the discrete cases are NP-complete.


  • [[Knapsack problem/Unbounded]]
  • [[Knapsack problem/Bounded]]
  • [[Knapsack problem/0-1]]
  • [[Knapsack problem/Continuous]]