Why branch-and-bound is approximate and not exact?

146 Views Asked by At

I have read that branch-and-bound paradigm is approximate. Can someone explain why this method is approximate and not exact? what it means that it's approximation? I implemented it for knapsack problem and always when I run this algorithm, it gives me exact answer.

0

There are 0 best solutions below