A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Crossref DOI link: https://doi.org/10.1007/s11075-020-01065-7
Published Online: 2021-05-27
Published Print: 2021-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Luo, Hezhi
Chen, Sikai
Wu, Huixian
Text and Data Mining valid from 2021-05-27
Version of Record valid from 2021-05-27
Article History
Received: 20 April 2020
Accepted: 28 December 2020
First Online: 27 May 2021