APA (7th ed.) Citation

Angelelli, E., Mansini, R., & Rizzi, R. (2026). A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree. Mathematics of Operations Research (INFORMS), 51(1), 476. https://doi.org/10.1287/moor.2022.0306

Chicago Style (17th ed.) Citation

Angelelli, Enrico, Renata Mansini, and Romeo Rizzi. "A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree." Mathematics of Operations Research (INFORMS) 51, no. 1 (2026): 476. https://doi.org/10.1287/moor.2022.0306.

MLA (9th ed.) Citation

Angelelli, Enrico, et al. "A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree." Mathematics of Operations Research (INFORMS), vol. 51, no. 1, 2026, p. 476, https://doi.org/10.1287/moor.2022.0306.