Module knapsack 

Knapsack problem solvers

The knapsack problem: select items to maximize value within capacity.

Variants

• 0-1 Knapsack: Take or leave each item
• Bounded: Limited copies of each item
• Unbounded: Unlimited copies
• Multidimensional: Multiple capacity constraints

Structs

DynamicProgrammingSolver

Dynamic programming solver for 0-1 knapsack

KnapsackProblem

A knapsack problem instance

KnapsackSolution

Solution to a knapsack problem

Traits

KnapsackSolver

Trait for knapsack solvers

Functions

solve

Solve 0-1 knapsack using dynamic programming