Giters

ds4dm / branch-search-trees

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)

Home Page:https://arxiv.org/abs/2002.05120

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Do you compare the solving time between default SCIP policies and learned policies ?

cloud-waiting-for-wind opened this issue · comments

commented

Great job! Very inspiring.

However, I think there is a lack of comparison of solving time between different methods in the same instances.
Although the paper reports the number of nodes explored by learned and SCIP policies, the number of nodes and solving time are not exactly equivalent. Neural network policies maybe run faster than default SCIP policies with the same number of explored nodes.

A lot of people pay attention to ML4CO because of its potential to speed up solving MILP problems. It would be better and more intuitive that there is a solving time comparison, just like Exact Combinatorial Optimization with Graph Convolutional Neural Networks, Gasse et al.