12
votes
3answers
563 views

Improving knapsack branch and bound: how to forward filter?

I've coded branch and bound to solve the knapsack problem, and use a greedy linear relaxation to find an upper bound on a node I'm currently exploring. What I mean by this is that I first sort the ...