Dong, Y., Olinick, E. V., Jason Kratz, T., & Matula, D. W. (2015). A compact linear programming formulation of the maximum concurrent flow problem. Networks, 65(1), 68. https://doi.org/10.1002/net.21583
Chicago Style (17th ed.) CitationDong, Yuanyuan, Eli V. Olinick, T. Jason Kratz, and David W. Matula. "A Compact Linear Programming Formulation of the Maximum Concurrent Flow Problem." Networks 65, no. 1 (2015): 68. https://doi.org/10.1002/net.21583.
MLA (9th ed.) CitationDong, Yuanyuan, et al. "A Compact Linear Programming Formulation of the Maximum Concurrent Flow Problem." Networks, vol. 65, no. 1, 2015, p. 68, https://doi.org/10.1002/net.21583.
Warning: These citations may not always be 100% accurate.