Also if you find two adjacent leaves, are these most likely the optimal solutions?
I have a general question: In the branch and bound method for solving integer programming problems, you can have more than one optimal solution right?
E.g I had as possible optimal solutions: where and where . These are both leaf nodes. This is for a maximization problem.