Gu, S. (2010, October). Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix. 2010 International Conference on Wireless Communications and Signal Processing, 1-5. https://doi.org/10.1109/WCSP.2010.5632199
Citácia podle Chicago (17th ed.)Gu, Shenshen. "Polynomial Time Solvable Algorithms to Binary Quadratic Programming Problems with Q Being a Tri-diagonal or Five-diagonal Matrix." 2010 International Conference on Wireless Communications and Signal Processing Oct. 2010: 1-5. https://doi.org/10.1109/WCSP.2010.5632199.
Citácia podľa MLA (8th ed.)Gu, Shenshen. "Polynomial Time Solvable Algorithms to Binary Quadratic Programming Problems with Q Being a Tri-diagonal or Five-diagonal Matrix." 2010 International Conference on Wireless Communications and Signal Processing, Oct. 2010, pp. 1-5, https://doi.org/10.1109/WCSP.2010.5632199.