4 citations · 13 across the 14 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2025★ 1 cited
Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling
Sirui Li, Wenbin Ouyang, Yining Ma +1
Long-horizon combinatorial optimization problems (COPs), such as the Flexible Job-Shop Scheduling Problem (FJSP), often involve complex, interdependent decisions over extended time…
math.OC2023★ 3 cited
Learning to Configure Separators in Branch-and-Cut
Sirui Li, Wenbin Ouyang, Max B. Paulus +1
Cutting planes are crucial in solving mixed integer linear programs (MILP) as they facilitate bound improvements on the optimal solution. Modern MILP solvers rely on a variety of s…