15 citations · 28 across the 4 of their papers we have counts for
4 papers
Learning to Cut via Hierarchical Sequence/Set Model for Efficient Mixed-Integer Programming
Jie Wang, Zhihai Wang, Xijun Li +7
Cutting planes (cuts) play an important role in solving mixed-integer linear programs (MILPs), which formulate many important real-world applications. Cut selection heavily depends…
Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning
Yufei Kuang, Xijun Li, Jie Wang +7
Large-scale LP problems from industry usually contain much redundancy that severely hurts the efficiency and reliability of solving LPs, making presolve (i.e., the problem simplifi…
Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model
Zhihai Wang, Xijun Li, Jie Wang +5
Cutting planes (cuts) are important for solving mixed-integer linear programs (MILPs), which formulate a wide range of important real-world applications. Cut selection -- which aim…
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…