Exact interdiction models and algorithms for disconnecting networks via node deletions

Abstract This paper analyzes the problem of maximizing the disconnectivity of undirected graphs by deleting a subset of their nodes. We consider three metrics that measure the connectivity of a graph: the number of connected components (which we attempt to maximize), the largest component size (which we attempt to minimize), and the minimum cost required to reconnect the graph after the nodes are deleted (which we attempt to maximize). We formulate each problem as a mixed-integer program, and then study valid inequalities for the first two connectivity objectives by examining intermediate dynamic programming solutions to k -hole subgraphs. We randomly generate a set of test instances, on which we demonstrate the computational efficacy of our approaches.

[1]  J. C. Smith,et al.  Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .

[2]  I. Esra Buyuktahtakin,et al.  Mixed integer programming approaches to lot-sizing and asset replacement problems , 2009 .

[3]  Churlzu Lim,et al.  Algorithms for Network Interdiction and Fortification Games , 2008 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Panos M. Pardalos,et al.  Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

[6]  Alan T. Murray,et al.  Exploring the vulnerability of network infrastructure to disruption , 2008 .

[7]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Zhou Tao,et al.  Epidemic dynamics on complex networks , 2006 .

[10]  Jose M. Arroyo,et al.  Bilevel programming applied to power system vulnerability analysis under multiple contingencies , 2010 .

[11]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[12]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[13]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[14]  Benjamin Fabian,et al.  How Robust is the Internet? - Insights from Graph Analysis , 2014, CRiSIS.

[15]  Yuhai Tu,et al.  How robust is the Internet? , 2000, Nature.

[16]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[17]  Marco Di Summa,et al.  Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  Ali Ridha Mahjoub,et al.  Design of Survivable Networks: A survey , 2005, Networks.

[20]  David P. Morton,et al.  Stochastic Network Interdiction , 1998, Oper. Res..

[21]  Alan T. Murray,et al.  A Methodological Overview of Network Vulnerability Analysis , 2008 .

[22]  Ibrahim. Akgun.  The K-Group Maximum-Flow Network-Interdiction Problem , 2000 .

[23]  Taieb Znati,et al.  On Approximation of New Optimization Methods for Assessing Network Vulnerability , 2010, 2010 Proceedings IEEE INFOCOM.

[24]  Jonathan Cole Smith,et al.  Survivable network design under optimal and heuristic interdiction scenarios , 2007, J. Glob. Optim..

[25]  Hanif D. Sherali,et al.  Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems , 1998, Oper. Res..

[26]  Pablo Alvarez,et al.  Tri-level optimization models to defend critical infrastructure , 2007 .

[27]  David L. Alderson,et al.  OR FORUM - Catching the "Network Science" Bug: Insight and Opportunity for the Operations Researcher , 2008, Oper. Res..

[28]  J. Cole Smith,et al.  Dynamic-programming-based inequalities for the capacitated lot-sizing problem , 2010 .

[29]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[30]  Gerald G. Brown,et al.  Defending Critical Infrastructure , 2006, Interfaces.

[31]  Jonathan Cole Smith,et al.  Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs , 2012, Networks.