2 papers
math.OC2026
Efficient exact sequential lifting algorithm for binary knapsack set
Xintong Wang, Liang Chen, Yu-Hong Dai
Lifting is a crucial technique in mixed integer programming (MIP) for generating strong valid inequalities, which serve as cutting planes to improve the branch-and-cut algorithm. W…
math.OC2025
A Dynamic Relaxation Framework for Global Solution of ACOPF
Yu-Yang Tang, Liang Chen, Sheng-Jie Chen +3
Solving the Alternating Current Optimal Power Flow (AC OPF) problem to global optimality remains challenging due to its nonconvex quadratic constraints. In this paper, we present a…