Ketkov, S. S., & Prokopyev, O. A. (2024). On a class of interdiction problems with partition matroids: Complexity and polynomial-time algorithms.
Cita Chicago Style (17a ed.)Ketkov, Sergey S., y Oleg A. Prokopyev. On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-time Algorithms. 2024.
Cita MLA (9a ed.)Ketkov, Sergey S., y Oleg A. Prokopyev. On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-time Algorithms. 2024.
Precaución: Estas citas no son 100% exactas.