Module knaptime::zeroonethreshold

0-1 Knapsack with threshold

A variant of the knapsack problem.

Given a list of items with associated weights and values, choose at most one of each given item. Maximize the value while ensuring the minimum weight greater than or equal to a given capacity.