APA (7th ed.) Citation

Günneç, D., Raghavan, S., & Zhang, R. (2020). A branch‐and‐cut approach for the least cost influence problem on social networks. Networks, 76(1), 84. https://doi.org/10.1002/net.21941

Chicago Style (17th ed.) Citation

Günneç, Dilek, S. Raghavan, and Rui Zhang. "A Branch‐and‐cut Approach for the Least Cost Influence Problem on Social Networks." Networks 76, no. 1 (2020): 84. https://doi.org/10.1002/net.21941.

MLA (9th ed.) Citation

Günneç, Dilek, et al. "A Branch‐and‐cut Approach for the Least Cost Influence Problem on Social Networks." Networks, vol. 76, no. 1, 2020, p. 84, https://doi.org/10.1002/net.21941.