activity
20132020
most citedMeasuring the tendency of CNNs to Learn Surface Statistical Regularities

191 citations · 346 across the 7 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.LG2020

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies

Giulia Zarpellon, Jason Jo, Andrea Lodi +1

Branch and Bound (B&B) is the exact tree search method typically used to solve Mixed-Integer Linear Programming problems (MILPs). Learning branching policies for MILP has become an…