← Search

Giulia Zarpellon

2 accepted papers

2022

Learning to Cut by Looking Ahead: Cutting Plane Selection via Imitation Learning

ICML 2022spotlight

Cutting planes are essential for solving mixed-integer linear problems (MILPs), because they facilitate bound improvements on the optimal solution value. For selecting cuts, modern solvers rely on manually designed heuristics that are tuned to gauge the potential effectiveness of cuts. We show that…

2021

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

AAAI 2021technical

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 active research area, with most works proposing to imitate the strong branching rule and specialize it to distinct clas…