APA (7th ed.) Citation

Ghiyasvand, M. (2017). A faster strongly polynomial time algorithm to solve the minimum cost tension problem. Journal of combinatorial optimization, 34(1), 203-217. https://doi.org/10.1007/s10878-016-0070-4

Chicago Style (17th ed.) Citation

Ghiyasvand, Mehdi. "A Faster Strongly Polynomial Time Algorithm to Solve the Minimum Cost Tension Problem." Journal of Combinatorial Optimization 34, no. 1 (2017): 203-217. https://doi.org/10.1007/s10878-016-0070-4.

MLA (9th ed.) Citation

Ghiyasvand, Mehdi. "A Faster Strongly Polynomial Time Algorithm to Solve the Minimum Cost Tension Problem." Journal of Combinatorial Optimization, vol. 34, no. 1, 2017, pp. 203-217, https://doi.org/10.1007/s10878-016-0070-4.