173 citations · 554 across the 16 of their papers we have counts for
1 paper · 2 filters
D. Sorokin, A. Kostin, L. Savchenko +2
A convenient approach to optimally solving combinatorial optimization tasks is the Branch-and-Bound method. Its branching heuristic can be learned to solve a large set of similar t…