An integer programming framework for critical elements detection in graphs

作者：Veremyev Alexander; Prokopyev Oleg A^*; Pasiliao Eduardo L

来源：Journal of Combinatorial Optimization, 2014, 28(1): 233-273.

DOI：10.1007/s10878-014-9730-4

• Critical node detection
• Critical edge detection
• Network interdiction
• Mixed integer programming

This study presents an integer programming framework for minimizing the connectivity and cohesiveness properties of a given graph by removing nodes and edges subject to a joint budgetary constraint. The connectivity and cohesiveness metrics are assumed to be general functions of sizes of the remaining connected components and node degrees, respectively. We demonstrate that our approach encompasses, as special cases (possibly, under some mild conditions), several other models existing in the literature, including minimization of the total number of connected node pairs, minimization of the largest connected component size, and maximization of the number of connected components. We discuss computational complexity issues, derive linear mixed integer programming (MIP) formulations, and describe additional modeling enhancements aimed at improving the performance of MIP solvers. We also conduct extensive computational experiments with real-life and randomly generated network instances under various settings that reveal interesting insights and demonstrate advantages and limitations of the proposed framework.

• 出版日期2014-7