Finding the n Most Vital Nodes in a Flow Network
From MaRDI portal
Publication:4077761
DOI10.1287/mnsc.21.3.362zbMath0316.90077OpenAlexW2016305567MaRDI QIDQ4077761
Publication date: 1974
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.3.362
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (10)
The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm ⋮ The stochastic critical node problem over trees ⋮ Most vital links and nodes in weighted networks ⋮ Mitigating Interdiction Risk with Fortification ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ On the Independent Set Interdiction Problem
This page was built for publication: Finding the n Most Vital Nodes in a Flow Network
