11 citations · 17 across the 4 of their papers we have counts for
4 papers
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…
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…
Learning to Reformulate for Linear Programming
Xijun Li, Qingyu Qu, Fangzhou Zhu +4
It has been verified that the linear programming (LP) is able to formulate many real-life optimization problems, which can obtain the optimum by resorting to corresponding solvers…
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…