Branch-and-Bound represents a cornerstone methodology for solving discrete optimisation problems by systematically exploring a search tree of candidate solutions. Each node in the tree corresponds to ...