On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms.
Saved in:
| Title: | On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms. |
|---|---|
| Authors: | Ketkov, Sergey S.1, sergei.ketkov@business.uzh.ch, Prokopyev, Oleg A.1, oleg.prokopyev@business.uzh.ch |
| Source: | INFORMS Journal on Computing; May/Jun2026, Vol. 38 Issue 3, p998-1015, 18p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
