Burer, S., Kim, S., & Kojima, M. (2014). Faster, but weaker, relaxations for quadratically constrained quadratic programs. Computational optimization and applications, 59(1-2), 27-45. https://doi.org/10.1007/s10589-013-9618-8
Chicago Style (17th ed.) CitationBurer, Samuel, Sunyoung Kim, and Masakazu Kojima. "Faster, but Weaker, Relaxations for Quadratically Constrained Quadratic Programs." Computational Optimization and Applications 59, no. 1-2 (2014): 27-45. https://doi.org/10.1007/s10589-013-9618-8.
MLA (9th ed.) CitationBurer, Samuel, et al. "Faster, but Weaker, Relaxations for Quadratically Constrained Quadratic Programs." Computational Optimization and Applications, vol. 59, no. 1-2, 2014, pp. 27-45, https://doi.org/10.1007/s10589-013-9618-8.
Warning: These citations may not always be 100% accurate.