APA (7th ed.) Citation

Sedeño-Noda, A., & González-Martı́n, C. (2001). An algorithm for the biobjective integer minimum cost flow problem. Computers & operations research, 28(2), 139-156. https://doi.org/10.1016/S0305-0548(99)00095-7

Chicago Style (17th ed.) Citation

Sedeño-Noda, A., and C. González-Martı́n. "An Algorithm for the Biobjective Integer Minimum Cost Flow Problem." Computers & Operations Research 28, no. 2 (2001): 139-156. https://doi.org/10.1016/S0305-0548(99)00095-7.

MLA (9th ed.) Citation

Sedeño-Noda, A., and C. González-Martı́n. "An Algorithm for the Biobjective Integer Minimum Cost Flow Problem." Computers & Operations Research, vol. 28, no. 2, 2001, pp. 139-156, https://doi.org/10.1016/S0305-0548(99)00095-7.