View in EDS HTML Full Text PDF Full Text

On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms.

Saved in:
Bibliographic Details
Title: On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms.
Authors: Ketkov, Sergey S.1 (AUTHOR) sergei.ketkov@business.uzh.ch, Prokopyev, Oleg A.1 (AUTHOR) oleg.prokopyev@business.uzh.ch
Source: INFORMS Journal on Computing. May/Jun2026, Vol. 38 Issue 3, p998-1015. 18p.
Database: Business Source Ultimate
Full text is not displayed to guests.
Description
ISSN:10919856
DOI:10.1287/ijoc.2024.0599