APA (7th ed.) Citation

Ketkov, S. S., & Prokopyev, O. A. (2026). On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms. INFORMS Journal on Computing, 38(3), 998. https://doi.org/10.1287/ijoc.2024.0599

Chicago Style (17th ed.) Citation

Ketkov, Sergey S., and Oleg A. Prokopyev. "On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms." INFORMS Journal on Computing 38, no. 3 (2026): 998. https://doi.org/10.1287/ijoc.2024.0599.

MLA (9th ed.) Citation

Ketkov, Sergey S., and Oleg A. Prokopyev. "On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms." INFORMS Journal on Computing, vol. 38, no. 3, 2026, p. 998, https://doi.org/10.1287/ijoc.2024.0599.