Supervised learning in Branch-and-cut strategies

  title={Supervised learning in Branch-and-cut strategies},
  author={Abdellatif El Afia and Mohamed Mustapha Kabbaj},
Branch-and-Cut is a powerful algorithm used for solving MILP problems. It involves two main sub-algorithms: branch-and-bound and cutting plane. On the one hand, the branch-and-bound algorithm comprises two strategies that are node selection strategy and branching strategy. These two strategies in literature don't exploit information of each other, and… CONTINUE READING