Atkinson, N., Ganz, S., Hochbaum, D., & Orlin, J. (2025). The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. INFORMS Journal on Optimization, 7(2), 142. https://doi.org/10.1287/ijoo.2024.0030
Chicago Style (17th ed.) CitationAtkinson, Nathan, Scott Ganz, Dorit Hochbaum, and James Orlin. "The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings." INFORMS Journal on Optimization 7, no. 2 (2025): 142. https://doi.org/10.1287/ijoo.2024.0030.
MLA (9th ed.) CitationAtkinson, Nathan, et al. "The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings." INFORMS Journal on Optimization, vol. 7, no. 2, 2025, p. 142, https://doi.org/10.1287/ijoo.2024.0030.