A cutting plane algorithm for computing \(k\)-edge survivability of a network
From MaRDI portal
Publication:1877897
DOI10.1016/S0377-2217(03)00135-8zbMath1056.90015OpenAlexW2034304357MaRDI QIDQ1877897
Young-Soo Myung, Hyun-Joon Kim
Publication date: 19 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00135-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (17)
Circular and radial design comparison of survivability in asymmetrical hierarchical networks ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ Network interdiction via a critical disruption path: branch-and-price algorithms ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ An integer programming framework for critical elements detection in graphs ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ The critical node detection problem in networks: a survey ⋮ Systems under attack-survivability rather than reliability: concept, results, and applications ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ Detecting critical nodes in sparse graphs ⋮ Optimal \(K\)-node disruption on a node-capacitated network ⋮ Selected Topics in Critical Element Detection
Uses Software
Cites Work
This page was built for publication: A cutting plane algorithm for computing \(k\)-edge survivability of a network
