0/1 knapsack solved exactly with a fractional-relaxation bound — watch whole subtrees die the moment their optimistic bound can't beat the best.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Knapsack Branch & Bound Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. 0/1 knapsack solved exactly with a fractional-relaxation bound — watch whole subtrees die the moment their optimistic bound can't beat the best. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
TSP Branch & Bound Visualizer: Exact travelling-salesman solving animated: partial tours extend depth-first while the bound prunes any branch that can't beat the best tour found.
Open tool0/1 Knapsack Visualizer: The 0/1 knapsack DP table animated cell by cell: skip-or-take decisions with the exact cells each value reads from, ending at the optimal bottom-right answer.
Open toolFractional Knapsack Visualizer: Greedy by value density animated: take the densest items whole, split the last one — and see exactly why splitting is what makes greedy optimal here.
Open tool10/1 knapsack by branch & bound (capacity 8): DFS over take/skip choices, pruning any branch whose FRACTIONAL-relaxation bound can't beat the best complete solution.
sort by value densitynode(i, w, v):leaf → update bestNEW BEST at a leafbound(i,w,v) ≤ best → PRUNEbranch: take item i / skip item ioptimal = best at the end
DFS over take/skip decisions with the FRACTIONAL knapsack as an optimistic bound: if even the relaxation can't beat the best, the whole subtree dies.
