The 0/1 knapsack problem is one of the most classic NP-hard problems in computer science: given a set of items, each with a weight and a value, select items under a knapsack capacity constraint to maximize total value.