APA (7th ed.) Citation

Punnen, A. P., Sripratak, P., & Karapetyan, D. (2015). The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases. Discrete Applied Mathematics, 193, 1-10. https://doi.org/10.1016/j.dam.2015.04.004

Chicago Style (17th ed.) Citation

Punnen, Abraham P., Piyashat Sripratak, and Daniel Karapetyan. "The Bipartite Unconstrained 0–1 Quadratic Programming Problem: Polynomially Solvable Cases." Discrete Applied Mathematics 193 (2015): 1-10. https://doi.org/10.1016/j.dam.2015.04.004.

MLA (9th ed.) Citation

Punnen, Abraham P., et al. "The Bipartite Unconstrained 0–1 Quadratic Programming Problem: Polynomially Solvable Cases." Discrete Applied Mathematics, vol. 193, 2015, pp. 1-10, https://doi.org/10.1016/j.dam.2015.04.004.