The probability that a sub-problem chosen by branch and bound will be solved by the assignment problem and will produce an optimal tour is less than the probability that the search will become a leaf node
The probability that a sub-problem chosen by branch and bound will be solved by the assignment problem and will produce an optimal tour is less than the probability that the search will becomea leaf node