Citace podle APA (7th ed.)

Kochenberger, G., Hao, J., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y. (2014). The unconstrained binary quadratic programming problem: A survey. Journal of combinatorial optimization, 28(1), 58-81. https://doi.org/10.1007/s10878-014-9734-0

Citace podle Chicago (17th ed.)

Kochenberger, Gary, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, a Yang Wang. "The Unconstrained Binary Quadratic Programming Problem: A Survey." Journal of Combinatorial Optimization 28, no. 1 (2014): 58-81. https://doi.org/10.1007/s10878-014-9734-0.

Citace podle MLA (9th ed.)

Kochenberger, Gary, et al. "The Unconstrained Binary Quadratic Programming Problem: A Survey." Journal of Combinatorial Optimization, vol. 28, no. 1, 2014, pp. 58-81, https://doi.org/10.1007/s10878-014-9734-0.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..