Mohamed Mustapha Kabbaj

Towards learning integral strategy of branch and bound

2016

Branch and bound is the preferred algorithm used for solving MILP problems. It involves two fundamental strategies that are node selection strategy and branching strategy. Whereas the learning literature has been focused in dealing with …