Deng, Z., Fang, S., Lu, C., & Guo, X. (2018). A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems. Optimization, 67(2), 359-375. https://doi.org/10.1080/02331934.2017.1391253
Chicago Style (17th ed.) CitationDeng, Zhibin, Shu-Cherng Fang, Cheng Lu, and Xiaoling Guo. "A Branch-and-cut Algorithm Using Polar Cuts for Solving Nonconvex Quadratic Programming Problems." Optimization 67, no. 2 (2018): 359-375. https://doi.org/10.1080/02331934.2017.1391253.
MLA (9th ed.) CitationDeng, Zhibin, et al. "A Branch-and-cut Algorithm Using Polar Cuts for Solving Nonconvex Quadratic Programming Problems." Optimization, vol. 67, no. 2, 2018, pp. 359-375, https://doi.org/10.1080/02331934.2017.1391253.
Warning: These citations may not always be 100% accurate.