Could anybody please explain what the difference between bounding and pruning in branch and bound algorithms is?I'd also appreciate references (preferably books), where this distinction is made clear.
What is the difference between bounding and pruning in branch-and-bound algorithms?
algorithms;terminology;branch and bound