Determining the most vital link in a flow network

DOI10.1002/NAV.3800180408zbMATH Open0241.90020OpenAlexW2023858749MaRDI QIDQ5652428FDOQ5652428

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

Publication date: 1972

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800180408

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited In (6)

• The multi-terminal maximum-flow network-interdiction problem
• Convex hull representation of the deterministic bipartite network interdiction problem
• Maximizing residual flow under an arc destruction
• Deterministic network interdiction
• The most vital edges in the minimum spanning tree problem
• The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs

This page was built for publication: Determining the most vital link in a flow network

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