I beleive you're asking about how to solve the knapsack problem with a branch and bound algorithm (using proper terminology will get you better results). Yes, most of the resources are theories, because how you implement the algorithm depends on the problem being solved (not to say that you can't implement B&B in a higher order). This page has a nice illistration of the proccess.
So, the first thing, before you even start coding, would be to decide how you want to branch, and how you want to bound. Once you've decided on paper how you want to do this, start implementing them. Test it against some cannidate solutions and see how well they work. Now implementing the rest of the algortihm should become more mechanical.