CORL: Reinforcement Learning of MILP Policies Solved via Branch and Bound

Akhil S Anand, Elias Aarekol, Martin Mziray Dalseg +2

Combinatorial sequential decision making problems are typically modeled as mixed integer linear programs (MILPs) and solved via branch and bound (B&B) algorithms. The inherent diff…