Finding the n Most Vital Links in Flow Networks

DOI10.1287/mnsc.21.5.531zbMath0311.90073OpenAlexW4243636993MaRDI QIDQ4071029

H. Donald Ratliff, G. Thomas Sicilia, S. H. Lubore

Publication date: 1975

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.21.5.531

Mathematics Subject Classification ID

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

Related Items (28)

Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Critical edges/nodes for the minimum spanning tree problem: complexity and approximation ⋮ An iterative security game for computing robust and adaptive network flows ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers ⋮ Most vital links and nodes in weighted networks ⋮ The maximum clique interdiction problem ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Formulations for designing robust networks. An application to wind power collection ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem ⋮ The most vital edges in the minimum spanning tree problem ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ Network flow interdiction on planar graphs ⋮ On the power of randomization in network interdiction ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ Perfect matching interdiction problem restricted to a stable vertex ⋮ A survey of network interdiction models and algorithms ⋮ Deterministic network interdiction ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

This page was built for publication: Finding the n Most Vital Links in Flow Networks