Ningji Wei – Page 2 – Optimization Online

Integer Programming Methods for Solving Binary Interdiction Games

Published: 2021/04/26

0-1 Programming attacker-defender, interdiction, network optimization, polyhedral analysis, set covering

This paper studies a general class of interdiction problems in which the solution space of both the leader and follower are characterized by two discrete sets denoted the leader’s strategy set and the follower’s structure set. In this setting, the interaction between any strategy-structure pair is assumed to be binary, in the sense that the … Read more

Integer Programming Formulations for Minimum Spanning Tree Interdiction

Published: 2019/07/06, Updated: 2020/12/04

Branch and Cut Algorithms, Integer Programming, Network Optimization bi-level optimization, minimum edge blocker problems, minimum spanning tree, network interdiction

We consider a two-player interdiction problem staged over a graph where the leader’s objective is to minimize the cost of removing edges from the graph so that the follower’s objective, i.e., the weight of a minimum spanning tree in the residual graph, is increased up to a predefined level $r$. Standard approaches for graph interdiction … Read more