Christopher W. F. Parsonson

Reinforcement Learning for Branch-and-Bound Optimisation Using Retrospective Trajectories

Combinatorial optimisation problems framed as mixed integer linear programmes (MILPs) are ubiquitous across a range of real-world applications. The canonical branch-and-bound algorithm seeks to exactly solve MILPs by constructing a search tree of increasingly constrained sub-problems. In practice, i…