An integer programming framework for critical elements detection in graphs
From MaRDI portal
Publication:405684
DOI10.1007/s10878-014-9730-4zbMath1303.90120OpenAlexW1987468019MaRDI QIDQ405684
Eduardo L. Pasiliao, Alexander Veremyev, Oleg A. Prokopyev
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9730-4
Related Items (35)
Complexity of the multilevel critical node problem ⋮ Hybrid constructive heuristics for the critical node problem ⋮ Minimum cost edge blocker clique problem ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Minimum edge blocker dominating set problem ⋮ Improved formulations for minimum connectivity network interdiction problems ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ A Region Growing Algorithm for Detecting Critical Nodes ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ The bi-objective critical node detection problem ⋮ Wildfire fuel management: network-based models and optimization of prescribed burning ⋮ Integer programming methods for solving binary interdiction games ⋮ The connected critical node problem ⋮ Critical node/edge detection problems on trees ⋮ The stochastic critical node problem over trees ⋮ On designing networks resilient to clique blockers ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ A compact mixed integer linear formulation for safe set problems ⋮ Graph signatures: identification and optimization ⋮ The critical node detection problem in networks: a survey ⋮ An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs ⋮ The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- A derandomized approximation algorithm for the critical node detection problem
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Intermediate integer programming representations using value disjunctions
- Detecting critical nodes in sparse graphs
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Connected components in random graphs with given expected degree sequences
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Exact identification of critical nodes in sparse networks via new compact formulations
- The Valve Location Problem in Simple Network Topologies
- The university of Florida sparse matrix collection
- Cardinality-Constrained Critical Node Detection Problem
- How to Cut a Graph into Many Pieces
- Statistical mechanics of complex networks
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- The Structure and Function of Complex Networks
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Selected Topics in Critical Element Detection
- Node-and edge-deletion NP-complete problems
- Disconnecting graphs by removing vertices: a polyhedral approach
This page was built for publication: An integer programming framework for critical elements detection in graphs
