Cite
HARVARD Citation
Deng, Z. et al. (2018). A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems. Optimization. pp. 359-375. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Deng, Z. et al. (2018). A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems. Optimization. pp. 359-375. [Online].