435 citations · 643 across the 8 of their papers we have counts for
1 paper · 1 filter
Rui Wang, Zhiming Zhou, Tao Zhang +4
Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the…