TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization

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…