Finding the n Most Vital Links in Flow Networks

DOI10.1287/MNSC.21.5.531MaRDI QIDQ4071029zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(32)

• Most vital links and nodes in weighted networks
• The most vital edges in the minimum spanning tree problem
• The maximum clique interdiction problem
• Formulations for designing robust networks. An application to wind power collection
• Efficient determination of the k most vital edges for the minimum spanning tree problem
• On the power of randomization in network interdiction
• Perfect matching interdiction problem restricted to a stable vertex
• Deterministic network interdiction
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
• Convex hull representation of the deterministic bipartite network interdiction problem
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• A survey of network interdiction models and algorithms
• An iterative security game for computing robust and adaptive network flows
• Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information
• Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
• A class of algorithms for mixed-integer bilevel min-max optimization
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
• Engpässe, Staustellen und glatte homogene Ströme in Netzen
• Sequential Shortest Path Interdiction with Incomplete Information
• Evader interdiction: algorithms, complexity and collateral damage
• Multilevel approaches for the critical node problem
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
• 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
• The all-pairs vitality-maximization (VIMAX) problem
• The critical node game
• Vital edges for (s,t)-mincut: efficient algorithms, compact structures, \& optimal sensitivity oracles
• The Maximal covering location disruption problem
• Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
• Network flow interdiction on planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071029)