APA (7th ed.) Citation

Tuy, H., Ghannadan, S., Migdalas, A., & VÄrbrand, P. (1995). Strongly polynomial algorithm for two special minimum concave cost network flow problems. Optimization, 32(1), 23-43. https://doi.org/10.1080/02331939508844033

Chicago Style (17th ed.) Citation

Tuy, H., S. Ghannadan, A. Migdalas, and P. VÄrbrand. "Strongly Polynomial Algorithm for Two Special Minimum Concave Cost Network Flow Problems." Optimization 32, no. 1 (1995): 23-43. https://doi.org/10.1080/02331939508844033.

MLA (9th ed.) Citation

Tuy, H., et al. "Strongly Polynomial Algorithm for Two Special Minimum Concave Cost Network Flow Problems." Optimization, vol. 32, no. 1, 1995, pp. 23-43, https://doi.org/10.1080/02331939508844033.