Minimum vertex cover problem for coupled interdependent networks with cascading failures

DOI10.1016/j.ejor.2013.08.008zbMath1305.90091OpenAlexW2117839593MaRDI QIDQ2255970

Alexey Sorokin, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir L. Boginski

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.008

zbMATH Keywords

interdependent networksminimum vertex covercascading failuresdepth of cascadelinear 0-1 formulationsLP approximation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (5)

Fortification Against Cascade Propagation Under Uncertainty ⋮ Flight from COVID-19: multiscale and multilayer analyses of the epidemic-induced network adaptations ⋮ Vulnerability analysis of interdependent network via integer programming approaches ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures ⋮ Set-weighted games and their application to the cover problem

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Cardinality-Constrained Critical Node Detection Problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation

This page was built for publication: Minimum vertex cover problem for coupled interdependent networks with cascading failures