11 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.LG2022★ 1 cited
Offline Reinforcement Learning with Adaptive Behavior Regularization
Yunfan Zhou, Xijun Li, Qingyu Qu
Offline reinforcement learning (RL) defines a sample-efficient learning paradigm, where a policy is learned from static and previously collected datasets without additional interac…
math.OC2022★ 2 cited
Yordle: An Efficient Imitation Learning for Branch and Bound
Qingyu Qu, Xijun Li, Yunfan Zhou
Combinatorial optimization problems have aroused extensive research interests due to its huge application potential. In practice, there are highly redundant patterns and characteri…
cs.LG2022★ 11 cited
An Improved Reinforcement Learning Algorithm for Learning to Branch
Qingyu Qu, Xijun Li, Yunfan Zhou +6
Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\&B) is a general and widely used method. Recentl…