0/1 Knapsack Solver — Exact DP Capacity Planning

Choose this endpoint when you need an exact optimal solution to a 0/1 knapsack problem (each item selected at most once) with full DP evidence and deterministic tie-breaking. Prefer it over heuristic bin-packing when correctness and reproducibility matter more than speed at large scale. Use it for budget/capacity planning, portfolio selection, or any scenario where you must maximize value under a hard capacity constraint and need a provably optimal, auditable answer.

• Items list is empty or malformed — returns validation error
• Capacity value is zero or negative — returns error or trivially empty selection
• Very large item counts or capacities may exceed work bounds and return a bounded-work error
• Weights or values contain non-numeric or negative entries — returns input validation error
• Missing required fields in request body — returns 400-level error