Knapsack Problem (Branch and Bound) — Study Resources & PYQs
Knapsack problem solved using branch and bound
- Estimated study time: 50 minutes
Study resources
- 0/1 Knapsack Problem (Branch & Bound) (Article) — Solves 0/1 Knapsack using Branch & Bound with upper-bound greedy estimation and pruning.
- Full Branch & Bound (Knapsack + TSP) (Video) — Complete playlist covering Branch & Bound: 0/1 Knapsack and Travelling Salesman with examples.
Taught in these subjects
- Analysis & Design of Algorithms — CST-3501 · Government College of Engineering and Technology, Jammu