Author:
Bai Lijie,Mitchell John E.,Pang Jong-Shi
Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Billionnet, A., Elloumi, E. Lambert, A.: Extending the QCR method to general mixed-integer programs. Math. Program. Ser. B 131, 381–401 (2012). doi: 1.1007/s10107-010-038-7
2. Billionnet, A., Elloumi, E., Plateau, M.: Improving the performance of standard solvers for quadratic 0–1 programs by a tight convex reformulation: The QCR method. Dis. Appl. Math. 157, 1185–1197 (2009)
3. Bai, L., Mitchell, J.E. , Pang, J.S.: On convex quadratic programs with linear complementarity constraints. Comput. Opt. Appl. 54, 517–554 (2013). doi: 10.1007/s10589-012-9497-4
4. Codato, G., Fischetti, M.: Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54, 738–766 (2006)
5. Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Opt. 10, 367–380 (1997)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献