  


Integer Programming Formulations for Minimum Spanning Tree Interdiction
Ningji Wei(ningjiwebuffalo.edu) Abstract: We consider a twoplayer 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 frame this type of problems as bilevel formulations, which are commonly solved by replacing the inner problem by its dual to produce a single level reformulation. In this paper we propose an alternative integer program derived from the combinatorial structure of the follower's solution space and prove that this new formulation yields a stronger linear relaxation than the bilevel counterpart. We also study the convex hull of the feasible solutions of the problem and identify several families of facetdefining inequalities that can be used to strengthen the proposed integer program. We then proceed by introducing an alternative formulation defined by a set of socalled supervalid inequalities that may exclude feasible solutions, albeit solutions whose objective value is not better than that of an edge cut of minimum cost. We discuss several computational aspects required for an efficient implementation of the proposed approaches. Finally, we perform an extensive set of computational experiments to test the quality of our approaches by solving a large collection of reallife and randomly generated instances with various configurations, analyzing and comparing the benefits of each model, and also identifying further enhancements. Keywords: Network Interdiction, Minimum Spanning Tree, Minimum Edge Blocker Problems, Bilevel Optimization Category 1: Combinatorial Optimization (Branch and Cut Algorithms ) Category 2: Integer Programming Category 3: Network Optimization Citation: Download: [PDF] Entry Submitted: 07/06/2019 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  