An Efficient Decomposition Algorithm for Large-Scale Network Slicing. - Wei-Kun Chen; Ya-Feng Liu; Rui-Jin Zhang; Yu-Hong Dai; Zhi-Quan Luo (SPAWC, 2023)

IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming. - Rui-Jin Zhang; Xin-Wei Liu; Yu-Hong Dai (J. Glob. Optim., 2023)

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing. - Wei-Kun Chen; Zheyu Wu; Rui-Jin Zhang; Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (IEEE Trans. Signal Process., 2024)

IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming. - Rui-Jin Zhang; Xin-Wei Liu; Yu-Hong Dai (Comput. Optim. Appl., 2024)