The Knapsack problem where the objective function is to minimize the profit is –

The Knapsack problem is a classic optimization challenge. Branch and Bound is an algorithmic technique that effectively solves the 0/1 Knapsack problem by establishing bounds to prune suboptimal solutions. While Dynamic Programming is also applicable, Branch and Bound is the standard answer for optimization-focused Knapsack questions in many academic contexts.