Dubey, D., & Neogy, S. K. (2020). On solving a non-convex quadratic programming problem involving resistance distances in graphs. Annals of operations research, 287(2), 643-651. https://doi.org/10.1007/s10479-018-3018-5
Citácia podle Chicago (17th ed.)Dubey, Dipti, a S. K. Neogy. "On Solving a Non-convex Quadratic Programming Problem Involving Resistance Distances in Graphs." Annals of Operations Research 287, no. 2 (2020): 643-651. https://doi.org/10.1007/s10479-018-3018-5.
Citácia podľa MLA (8th ed.)Dubey, Dipti, a S. K. Neogy. "On Solving a Non-convex Quadratic Programming Problem Involving Resistance Distances in Graphs." Annals of Operations Research, vol. 287, no. 2, 2020, pp. 643-651, https://doi.org/10.1007/s10479-018-3018-5.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..