**Branch and Bound Algorithm**

Okay, for one of my CS classes we are supposed to implement a branch and bound algorith for the traveling salesman problem.

I understand the concept of the traveling salesman problem, but I don't understand the branch and bound algorithm at all. I have tried searching on google but am continuosly lost in the mass of bad explinations and the teachers outlines that don/t really tell me anything.

Is there anyone out there who explain it to me a little more, or does anyone have decent link where I could go to figure it out?

Last edited: Apr 25, 2005