A DC Programming Approach for Mixed-Integer Linear Programs. - Yi-Shuai Niu; Pham Dinh Tao (MCO, 2008)

An efficient DC programming approach for portfolio decision with higher moments. - Tao Pham Dinh; Yi-Shuai Niu (Comput. Optim. Appl., 2011)

DC Programming and DCA for Large-Scale Two-Dimensional Packing Problems. - Babacar Mbaye Ndiaye; Le Thi Hoai An; Pham Dinh Tao; Yi-Shuai Niu (ACIIDS (2), 2012)

Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem. - Yi-Shuai Niu; Tao Pham Dinh; Hoai An Le Thi; Joaquim João Júdice (Optim. Methods Softw., 2013)

DC Programming Approaches for BMI and QMI Feasibility Problems. - Yi-Shuai Niu; Tao Pham Dinh (ICCSAMA, 2014)

Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming. - Yi-Shuai Niu; Joaquim Júdice; Hoai An Le Thi; Tao Pham Dinh (MCO (1), 2015)

DC programming approaches for discrete portfolio optimization under concave transaction costs. - Tao Pham Dinh; Hoai An Le Thi; Viet Nga Pham; Yi-Shuai Niu (Optim. Lett., 2016)

Sentence Compression via DC Programming Approach. - Yi-Shuai Niu; Xi-Wei Hu; Yu You; Faouzi Mohamed Benammour; Hu Zhang (WCGO, 2019)

Parallel DC Cutting Plane Algorithms for Mixed Binary Linear Program. - Yi-Shuai Niu; Yu You; Wen-Zhuo Liu (WCGO, 2019)

Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem. - Yi-Shuai Niu; Joaquim Júdice; Hoai An Le Thi; Pham Dinh Tao (Appl. Math. Comput., 2019)

A Difference-of-Convex Programming Approach With Parallel Branch-and-Bound For Sentence Compression Via A Hybrid Extractive Model. - Yi-Shuai Niu; Yu You; Wenxu Xu; Wentao Ding; Junpeng Hu (CoRR, 2020)

A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program. - Yi-Shuai Niu; Yu You (CoRR, 2021)

Spatio-Temporal Neural Network for Fitting and Forecasting COVID-19. - Yi-Shuai Niu; Wentao Ding; Junpeng Hu; Wenxu Xu; Stéphane Canu (CoRR, 2021)

A Refined Inertial DCA for DC Programming. - Yu You; Yi-Shuai Niu (CoRR, 2021)

A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model. - Yi-Shuai Niu; Yu You; Wenxu Xu; Wentao Ding; Junpeng Hu; Songquan Yao (Optim. Lett., 2021)

On the convergence analysis of DCA. - Yi-Shuai Niu (CoRR, 2022)

Discrete Dynamical System Approaches for Boolean Polynomial Optimization. - Yi-Shuai Niu; Roland Glowinski (J. Sci. Comput., 2022)

An Accelerated DC Programming Approach with Exact Line Search for The Symmetric Eigenvalue Complementarity Problem. - Yi-Shuai Niu (CoRR, 2023)

Accelerated DC Algorithms for the Asymmetric Eigenvalue Complementarity Problem. - Yi-Shuai Niu (CoRR, 2023)

Understand the Effectiveness of Shortcuts through the Lens of DCA. - Youran Sun; Yihua Liu; Yi-Shuai Niu (CoRR, 2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials. - Yi-Shuai Niu; Hoai An Le Thi; Tao Pham Dinh (SIAM J. Optim., 2024)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs. - Hu Zhang; Yi-Shuai Niu (J. Optim. Theory Appl., 2024)