A variant of the O-1 knapsack problem.
Given a list of items in categories, pick at most one item from each category. Maximize the value while keeping the weight beneath a given capacity.