APA (7th ed.) Citation

Kim, S., Kojima, M., & Toh, K. (2016). A Lagrangian–DNN relaxation: A fast method for computing tight lower bounds for a class of quadratic optimization problems. Mathematical programming, 156(1-2), 161-187. https://doi.org/10.1007/s10107-015-0874-5

Chicago Style (17th ed.) Citation

Kim, Sunyoung, Masakazu Kojima, and Kim-Chuan Toh. "A Lagrangian–DNN Relaxation: A Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems." Mathematical Programming 156, no. 1-2 (2016): 161-187. https://doi.org/10.1007/s10107-015-0874-5.

MLA (9th ed.) Citation

Kim, Sunyoung, et al. "A Lagrangian–DNN Relaxation: A Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems." Mathematical Programming, vol. 156, no. 1-2, 2016, pp. 161-187, https://doi.org/10.1007/s10107-015-0874-5.