How does the Branch$-$and$-$Bound algorithm terminate a search path at a current node in the state$-$space tree

When a bound on a node is the same as the value of the bound on a previous node

the node does not represent a feasible solution. In other words, when the constraints of the problem are violated

When a bound cannot take all the constraints into account

When the value of the bound on the current node is negative