APA (7th ed.) Citation

Chen, Y., Rinks, D., & Tang, K. (2001). The first K minimum cost paths in a time-schedule network. The Journal of the Operational Research Society, 52(1), 102-108. https://doi.org/10.1057/palgrave.jors.2601028

Chicago Style (17th ed.) Citation

Chen, Y-L, D. Rinks, and K. Tang. "The First K Minimum Cost Paths in a Time-schedule Network." The Journal of the Operational Research Society 52, no. 1 (2001): 102-108. https://doi.org/10.1057/palgrave.jors.2601028.

MLA (9th ed.) Citation

Chen, Y-L, et al. "The First K Minimum Cost Paths in a Time-schedule Network." The Journal of the Operational Research Society, vol. 52, no. 1, 2001, pp. 102-108, https://doi.org/10.1057/palgrave.jors.2601028.