Gu, S., Cui, R., & Peng, J. (2016). Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems. Neurocomputing (Amsterdam), 198, 171-179. https://doi.org/10.1016/j.neucom.2015.09.130
Citace podle Chicago (17th ed.)Gu, Shenshen, Rui Cui, a Jiao Peng. "Polynomial Time Solvable Algorithms to a Class of Unconstrained and Linearly Constrained Binary Quadratic Programming Problems." Neurocomputing (Amsterdam) 198 (2016): 171-179. https://doi.org/10.1016/j.neucom.2015.09.130.
Citace podle MLA (9th ed.)Gu, Shenshen, et al. "Polynomial Time Solvable Algorithms to a Class of Unconstrained and Linearly Constrained Binary Quadratic Programming Problems." Neurocomputing (Amsterdam), vol. 198, 2016, pp. 171-179, https://doi.org/10.1016/j.neucom.2015.09.130.