A full-stack bounded knapsack optimizer with a cinematic frontend and reference implementations across Python, TypeScript, and Java.
The bounded knapsack problem: given items with weight, value, and a maximum number of copies (pieces), select quantities so total weight stays within capacity and total value is maximized.