APA (7th ed.) Citation

Lee, J., Joung, S., & Lee, K. (2022). A fully polynomial time approximation scheme for the probability maximizing shortest path problem. European journal of operational research, 300(1), 35-45. https://doi.org/10.1016/j.ejor.2021.10.018

Chicago Style (17th ed.) Citation

Lee, Jisun, Seulgi Joung, and Kyungsik Lee. "A Fully Polynomial Time Approximation Scheme for the Probability Maximizing Shortest Path Problem." European Journal of Operational Research 300, no. 1 (2022): 35-45. https://doi.org/10.1016/j.ejor.2021.10.018.

MLA (9th ed.) Citation

Lee, Jisun, et al. "A Fully Polynomial Time Approximation Scheme for the Probability Maximizing Shortest Path Problem." European Journal of Operational Research, vol. 300, no. 1, 2022, pp. 35-45, https://doi.org/10.1016/j.ejor.2021.10.018.