Learning to Branch

Maria-Florina Balcan, Travis Dick, Tuomas Sandholm +1

Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial and nonconvex problems. For example, they are the foremost method for sol…