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 ...

Scalable addressing of high-dimensional constrained combinatorial optimization problems is a challenge that arises in several science and engineering disciplines. Recent work introduced novel ...