Critical nodes in interdependent networks with deterministic and probabilistic cascading failures

DOI10.1007/s10898-018-0703-5zbMath1429.90089OpenAlexW2893948063WikidataQ129195917 ScholiaQ129195917MaRDI QIDQ2274858

Konstantin Pavlikov, My T. Thai, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir L. Boginski

Publication date: 1 October 2019

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0703-5

zbMATH Keywords

combinatorial optimizationconditional value-at-riskcritical nodesinterdependent networksvulnerability assessmentcascading failures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Conditional value‐at‐risk beyond finance: a survey, Flight from COVID-19: multiscale and multilayer analyses of the epidemic-induced network adaptations

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An integer programming framework for critical elements detection in graphs
• Detecting critical nodes in sparse graphs
• The budgeted maximum coverage problem
• Improved formulations for minimum connectivity network interdiction problems
• Compact models for critical node detection in telecommunication networks
• The critical node detection problem in networks: a survey
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Minimum vertex cover problem for coupled interdependent networks with cascading failures
• Exact identification of critical nodes in sparse networks via new compact formulations
• Approximating low-dimensional coverage problems
• Disconnecting graphs by removing vertices: a polyhedral approach